CS 3.5. (ALEVEL) - Sorting Algorithms

Question 1

Bubble sort

Answer 1

• Time complexity is O(n²)
• make passes through data and swaps adjacent items to order them , stops passing through data when no swaps performed

Question 2

Merge sort

Answer 2

-Time complexity is O(nlogn).
- Divide and Conquer method, split array into individual lists then merge them together sorted