CSE 3358 - Algorithms and Data Structures

AL KhOwaRIZMi 780 - 850 A.D.
Class
Caruth Room 224, Mon. Fri. 8:30am - 9:50am

Teaching staff
Lecturer: Saad Mneimneh, SIC Room 312
Office hours: Mon. 10:00am - 12:00pm, Wed. 10:00am - 11:00 am

Insertionsort Mergesort Quicksort Heapsort Radixsort
Worst case Θ(n2) Θ(nlogn) Θ(n2) Θ(nlogn) Θ(nlogk/logn)
Average case Θ(n2) Θ(nlogn) Θ(nlogn) O(nlogn) Θ(nlogk/logn)
Best case Θ(n) Θ(nlogn) Θ(nlogn) Θ(n) Θ(nlogk/logn)