Selection sort, bubble sort, and insertion sort have worst-case, average-case, and best-case time complexities of Θ(n^2). Heap sort, quick sort, and merge sort have average and best-case complexities of Θ(nlogn) but quick sort can degrade to Θ(n^2) in worst-case. Bucket sort and radix sort have average and worst-case complexities of Θ(n+k) and Θ(nk) respectively.
Selection sort, bubble sort, and insertion sort have worst-case, average-case, and best-case time complexities of Θ(n^2). Heap sort, quick sort, and merge sort have average and best-case complexities of Θ(nlogn) but quick sort can degrade to Θ(n^2) in worst-case. Bucket sort and radix sort have average and worst-case complexities of Θ(n+k) and Θ(nk) respectively.
Selection sort, bubble sort, and insertion sort have worst-case, average-case, and best-case time complexities of Θ(n^2). Heap sort, quick sort, and merge sort have average and best-case complexities of Θ(nlogn) but quick sort can degrade to Θ(n^2) in worst-case. Bucket sort and radix sort have average and worst-case complexities of Θ(n+k) and Θ(nk) respectively.