Sorting Algorithms Flashcards
1
Q
What is the functionality of Selection sort
A
Move the smallest value to the start.
2
Q
What is the functionality of bubble sort
A
Move the largest value to the end using pair wise comparosons and swapping
3
Q
What is the functionality of Insertion Sort
A
The Array is virtually splitted into 2 parts, Values from the unsorted part is picked and placed at the correct position of the sorted part.
4
Q
What is the functionality of Merge Sort
A
Merge method merges 2 sorted arrays and produce one sorted array, using the divide and conquer stradegy
5
Q
What is the Time complexity of Merge Sort
A
N log N
6
Q
What is the Time complexity of Insertion sort
A
log N
7
Q
What is the Time complexity of Bubble sort and Selection Sort
A
N ^ 2
8
Q
The Step by Step process of Merge Sort
A
- Divide the unsorted collection into 2
- Keep on dividing until the sub arrays only contain 1 element
- Merge the sub problemm solutions together.
