Page 216 - DCAP201_FUNDAMENTALS_OF_DATA_STRUCTURES

Manmohan Sharma, Lovely Professional University Unit 13: Sorting

Unit 13: Sorting Notes

CONTENTS
Objectives

Introduction
13.1 Insertion Sort
13.2 Selection Sort

13.3 Merge Sort
13.4 Radix Sort
13.5 Hashing

13.5.1 Hash Table
13.5.2 Hash Function
13.5.3 Working of Hashing

13.5.4 Types of Hashing
13.6 Some other Sorting Techniques
13.6.1 Bubble Sort
13.6.2 Quick Sort

13.6.3 Heap Sort
13.7 Summary

13.8 Keywords
13.9 Review Questions
13.10 Further Readings

Objectives

After studying this unit, you will be able to:

Define the concept of Insertion Sort
Describe the Selection Sort

Discuss the Merge Sort
Define the concept of Radix Sort
Know the Hashing

LOVELY PROFESSIONAL UNIVERSITY 209