Sorting Flashcards
Name the three sorting algorithms
- Bubble Sort
- Selection Sort
- Insertion Sort
True or False: Bubble Sort is the most efficient sorting algorithm.
False
How does Bubble Sort work?
By repeatedly passing over the list, comparing pairs of adjacent items and swapping them if necessary.
What is the maximum number of comparisons in Bubble Sort for an array of size N?
N*(N-1)/2
What is the key action of a Bubble Sort algorithm?
Swapping adjacent elements if they are in the wrong order.
What is the basic action of Selection Sort?
Search for the smallest item and place it at the beginning of the list.
This is if we want a list in ascending order
In Selection Sort, how many swaps are made on each pass?
One swap.
How does Insertion Sort operate?
By extracting each item in turn from the unsorted list and inserting it into the sorted part.
Which sorting algorithm is considered the best among the three discussed?
Insertion Sort
What is the method provided by Java for natural ordering?
Comparable interface
What does the compareTo method return when two objects are equal?
0
How many for loops are required when implementing a Bubble Sort algorithm?
Two
What happens to the number of elements to sort at the end of each pass in Selection Sort?
It is reduced by 1.
What is the average number of swaps in Bubble Sort?
N*(N-1)/4
What is the complexity of sorting algorithms based on?
- Number of comparisons
- Number of re-assignments
What is the method defined in the Comparable interface?
int compareTo(Object o)
This method compares the current object with another object.
What condition is checked in the bubble sort algorithm to determine if a swap is needed?
data[in].compareTo(data[in+1]) > 0
This condition checks if the current object is greater than the next one.
What condition is checked to find a new minimum in the selection sort algorithm?
data[in].compareTo(data[min]) < 0
This condition checks if the current object is less than the current minimum.
Which sorting algorithm is considered the simplest?
Bubbele
Selection Sort is often regarded as the simplest sorting algorithm.
Which sorting algorithm is considered the most efficient?
Insertion
Insertion Sort can be more efficient in practice for small or partially sorted datasets.
How many swaps are in a selection sort?
N-1
