1. Data Structures: A Pseudocode Approach with C, Second Edition1 Chapter 12 Objectives Upon completion you will be able to: Understand the basic concepts of internal sorts Discuss the relative efficiency of different sorts Recognize and discuss selection, insertion and exchange sorts Sorting

2. Data Structures: A Pseudocode Approach with C, Second Edition2

3. 3

4. 4 12-2 Selection Sorts In each pass of the selection sort, the smallest element is selected from the unsorted sublist and exchanged with the element at the beginning of the unsorted list. We discuss two classic selection sorts, straight selection and heap sort. Straight Selection Sort Heap Sort Selection Sort Efficiency Selection Sort Implementation

5. Data Structures: A Pseudocode Approach with C, Second Edition5

6. 6

7. 7

8. 8

9. 9

10. 10

11. Data Structures: A Pseudocode Approach with C, Second Edition11

12. Data Structures: A Pseudocode Approach with C, Second Edition12

13. Data Structures: A Pseudocode Approach with C, Second Edition13

14. Data Structures: A Pseudocode Approach with C, Second Edition14

15. Data Structures: A Pseudocode Approach with C, Second Edition15

16. Data Structures: A Pseudocode Approach with C, Second Edition16

17. Data Structures: A Pseudocode Approach with C, Second Edition17

18. Data Structures: A Pseudocode Approach with C, Second Edition18

19. Data Structures: A Pseudocode Approach with C, Second Edition19

20. Data Structures: A Pseudocode Approach with C, Second Edition20

21. Data Structures: A Pseudocode Approach with C, Second Edition21 12-3 Insertion Sorts In each pass of an insertion sort, one or more pieces of data are inserted into their correct location in an ordered list. In this section we study two insertion sorts: the straight insertion sort and the shell sort. Straight Insertion Sort Shell Sort Insertion Sort Efficiency Insertion Sort Implementation

22. Data Structures: A Pseudocode Approach with C, Second Edition22

23. Data Structures: A Pseudocode Approach with C, Second Edition23

24. Data Structures: A Pseudocode Approach with C, Second Edition24

25. Data Structures: A Pseudocode Approach with C, Second Edition25

26. Data Structures: A Pseudocode Approach with C, Second Edition26

27. Data Structures: A Pseudocode Approach with C, Second Edition27 (continued)

28. Data Structures: A Pseudocode Approach with C, Second Edition28

29. Data Structures: A Pseudocode Approach with C, Second Edition29

30. Data Structures: A Pseudocode Approach with C, Second Edition30

31. Data Structures: A Pseudocode Approach with C, Second Edition31

32. Data Structures: A Pseudocode Approach with C, Second Edition32

33. Data Structures: A Pseudocode Approach with C, Second Edition33

34. Data Structures: A Pseudocode Approach with C, Second Edition34

35. Data Structures: A Pseudocode Approach with C, Second Edition35 12-4 Exchange Sorts This section discusses the four basic queue operations. Using diagrammatic figures, it shows how each of them work. It concludes with a comprehensive example that demonstrates each operation. Bubble Sort Quick Sort Exchange Sort Efficiency Sort Summary Exchange Sort Implementation

36. Data Structures: A Pseudocode Approach with C, Second Edition36

37. Data Structures: A Pseudocode Approach with C, Second Edition37

38. Data Structures: A Pseudocode Approach with C, Second Edition38

39. Data Structures: A Pseudocode Approach with C, Second Edition39

40. Data Structures: A Pseudocode Approach with C, Second Edition40

41. Data Structures: A Pseudocode Approach with C, Second Edition41

42. Data Structures: A Pseudocode Approach with C, Second Edition42

43. Data Structures: A Pseudocode Approach with C, Second Edition43

44. Data Structures: A Pseudocode Approach with C, Second Edition44

45. Data Structures: A Pseudocode Approach with C, Second Edition45

46. Data Structures: A Pseudocode Approach with C, Second Edition46

47. Data Structures: A Pseudocode Approach with C, Second Edition47 12-5 External Sorts In external sorting portions of the data may be stored in secondary memory during the sorting process. Included in this section is a discussion of file merging and three external sort approaches-natural, balanced, and polyphase. Merging Ordered Files Merging Unordered Files The Sorting Process Sort Phase Revisited

48. Data Structures: A Pseudocode Approach with C, Second Edition48

49. Data Structures: A Pseudocode Approach with C, Second Edition49

50. Data Structures: A Pseudocode Approach with C, Second Edition50

51. Data Structures: A Pseudocode Approach with C, Second Edition51

52. Data Structures: A Pseudocode Approach with C, Second Edition52

53. Data Structures: A Pseudocode Approach with C, Second Edition53

54. Data Structures: A Pseudocode Approach with C, Second Edition54

55. Data Structures: A Pseudocode Approach with C, Second Edition55

56. Data Structures: A Pseudocode Approach with C, Second Edition56

57. Data Structures: A Pseudocode Approach with C, Second Edition57