WGU C949 Sorting/searching algorithms and their time complexities

Bubble Sort - Average/Typical: Θ(n²), Big-O/worst: O(n²), Past: No

Selection Sort - Average/Typical: Θ(n²), Big-O/worst: O(n²), Past: No

Insertion Sort - Average/Typical: Θ(n²), Big-O/worst: O(n²), Past: No

Quick Sort - Average/Typical: Θ(n log(n)), Big-O/worst: O(n²), Past: Yes

Bucket Sort - Average/Typical: Θ(n), Big-O/worst: O(n²), Past: Yes

Heap Sort - Average/Typical: Θ(n log(n)), Big-O/worst: O(n log(n)), Past: Yes

Merge Sort - Average/Typical: Θ(n log(n)), Big-O/worst: O(n log(n)), Past: Yes

Radix Sort - Average/Typical: Θ(n), Big-O/worst: O(n), Past: Yes