ArrayList in AP Computer Science A

ArrayList

Hashtable

HashMap

TreeSet

Bubble sort maintains the relative order of equal elements while sorting

Bubble Sort operates more efficiently in distributed systems compared to quicksort

Bubble sort has a faster worst-case runtime than quicksort's $O(n^2)$

Bubblesort uses less memory than quicksort during execution

Radix sort

Merge sort

Quick sort

Heap sort

To terminate the program immediately.

To skip over certain parts of code during execution.

To pause program execution and inspect values at a specific line.

To compile the program with optimizations for speed.

Merge sort.

Bubble sort.

Heap sort.

Quick sort.

It divides the ArrayList into a sorted subarray and an unsorted subarray, selecting the smallest element and swapping it with the first element

It compares adjacent elements and swaps them if they are in the wrong order

It selects the largest element and moves it to the end of the ArrayList

It randomly shuffles the elements in the ArrayList

Insertion sort

Quick sort

Selection sort

Merge sort

When accessing elements by index in an array.

Before searching for an element using binary search.

When ordering names alphabetically in a list.

To display scores from highest to lowest on a leaderboard.

declaring

sorting

encoding

looping

To rerun the entire program from the start.

To jump back to previous lines of code before a breakpoint.

To execute code line by line without stepping into functions.

To change variable values while running the code.