Week 7-8-9: Sorting Algorithms
After completing this chapter, you should be able to:
- Differentiate between Problems and Instances
- Understand different approaches for the Efficiency of Algorithms
- Limitations in Efficiency Comparison
- Shell sort
- Radix sort
- Merge sort
- Counting sort
- Bucket sort
- Quick sort
- Algorithm Comparison
Download Files
Course Material
- Week 1-2: Introduction to Analysis of Algorithms, Asymptotic Notation
- Week 3-4: Basics of Algorithms and Mathematics
- Week 5-6: Recurrence Relations
- Week 7-8-9: Sorting Algorithms
- Week 10-11: Data Structures and Algorithms
- Week 12-13: Elementary Data Structures and Algorithms
- Week 14: Huffman Coding and its Applications
- Chapters 7
- Department CS & IT(SCB)
- Teacher
Mr. Farrukh Jibran
