Save
...
Paper 1
Fundamentals of Algorithms
Sorting algorithms
Save
Share
Learn
Content
Leaderboard
Share
Learn
Created by
Shana Seruwo
Visit profile
Cards (4)
What is the time complexity for bubble sort in the best case scenario?
linear complexity of
O(n)
What is the general time complexity for bubble sort?
Polynomial complexity
O(n^2)
What is merge sort?
a
sorting algorithm
which sorts a data set by usng the
divide and conquer principle
Describe the steps of merge sort
Divide the
data set
into
sub groups
Divide the data set in the pairs
Divide the data set into individual values
Adjacent values
and paired back together in order