1. S O R T I N G A lecture by ABDUL GHAFFAR Chapter 3 Of Reference #1

5. Selection Sort (continue..)

6. Insertion Sort (Ref #1-7.2, Ref 2- 9.3)

7. Insertion Sort (continue..)

8. Insertion Sort (continue..)

9. Insertion Sort (continue..)

12. Merge Sort (continue..)

13. Merge Sort (continue..) Implementation in C++

14. Merge Sort (continue..) Implementation in C++ Merging The Merge function of the TwoWayMergeSorter<T> class is defined in Program . Altogether, this function takes four parameters: The first is a reference to the array to be sorted. The remaining three, left, middle, and right, are unsigned integers. It is assumed that Furthermore, it is assumed that the two subsequences of the array, and are both sorted. The Merge routine merges the two sorted subsequences using the temporary array specified by tempArray. It then copies the merged (and sorted) sequence into the array at

15. Merge Sort (continue..) Implementation in C++

16. Merge Sort (continue..) Implementation in C++

20. Quick Sort ( Continue… ) Example

21. Quick Sort ( Continue… ) Example

23. Quick Sort ( Continue… ) Implementation in C

26. Heap Sort (Continue..) Array representation of Binary Tree

32. Heap Sort (Continue..) Building a heap

33. Heap Sort (Continue..) Building a heap

34. Heap Sort (Continue..) Building a heap The Algorithm

36. Heap Sort (Continue..) Deleting the Root, an Example

37. Heap Sort (Continue..) Deleting the root (Algorithm)

38. Heap Sort (Continue..) Application algorithm

39. Heap Sort (Continue..) Implementation in C++

40. Heap Sort (Continue..) Implementation in C++

41. Heap Sort (Continue..) Implementation in C++

42. Heap Sort (Continue..) Implementation in C++

43. Heap Sort (Continue..) Implementation in C++

44. Heap Sort (Continue..) Implementation in C++ The Sorting Phase : Once the max heap has been built, heapsort proceeds to the sorting phase.b The sorting phase of heapsort works like this: We repeatedly swap the largest element in the heap (always in position 1) into the next position of the sorted sequence. After each such swap, there is a new value at the root of the heap and this new value is pushed down into the correct position in the heap using the Percolate Down routine.

45. Heap Sort (Continue..) Implementation in C++ The Sorting Phase : The next example explains this phase

46. Heap Sort (Continue..) Example

47. Heap Sort (Continue..) Example

48. Heap Sort (Continue..) Example

49. Heap Sort (Continue..) Example

50. External Sort

51. External Sort (continue…)

52. External Sort (continue…)