This document is about one of the searching and sorting techniques. I had prepare a PDF document about one of the Searching technique in Data structure that is Binary Search and one of the Sorting Technique that is Quick Sort.

1. INFORMATION AND TECHNOLOGY Branch Code : 016
Data Structures Subject code : 2130702
Presentation on
Quick Sort and Binary Search

2. Data Structure
Quick Sort and Binary Search

3. INDEX
Quick Sort
Binary Search
Summary
References

4. Quick Sort
Graphical Representation

5. Quick Sort
Quicksort Concept
(<pivot)
LEFT group
(> pivot)
RIGHT group apply Quicksort to the subgroups

6. Quick Sort
Quicksort Start
Unsorted Array

7. Quick Sort
Quicksort Step 1
26
33
35
29
19
pivot
12
22

8. Quick Sort
Quicksort Step 2
26
33
35
29
19
left
pivot
12
22
right

9. Quick Sort
Quicksort Step 3
26
33
35
29
19
left
pivot
12
22
right

10. Quick Sort
Quicksort Step 4
26
33
35
29
19
left
pivot
12
22
right
26
22
35
29
19
left
pivot
12
33
right

11. Quick Sort
Quicksort Step 5
left
26
22
35
29
19
left
pivot
12
33
right

12. Quick Sort
Quicksort Step 6
26
22
35
29
19
left
12
33
right
26
22
12
29
19
pivot
35
33
left
right
pivot

13. Quick Sort
Quicksort Step 7
26
22
12
29
19
left
pivot
35
33
right
26
22
12
19
29
left
pivot
35
33
right

14. Quick Sort
Quicksort Step 8
26
22
12
19
29
left
pivot
35
33
right
26
19
22
12
29
pivot
35
LEFT
RIGHT

15. Quick Sort
Quicksort Step 9
pivot
26
19
22
12
29
previous pivot
35
33
Quicksort
Quicksort
pivot
12
19
22
29
33
35
26
26
12
19
22
29
33
35

16. Quick Sort
Quicksort Efficiency

17. Quick Sort






Best Case

18. Quick Sort



Worst case

19. Quick Sort





Worst case for quicksort

20. Binary Search
Problem: Search





21. Binary Search
Search
[ 0 ] [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 700 ]
Number 506643548
Number Number 281942902 233667136
Number 701466868 Number 580625685 Number 155778322 …
Number 580625685

22. Binary Search
Binary Search




23. Binary Search
Binary Search





24. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

25. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

26. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

27. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

28. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

29. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

30. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

31. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

32. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

33. Binary Search
Example

[ 0 ]
[ 1 ]
3
6
7
11
32
33
53
[ 2 ]
[ 3 ]
[ 4 ]
[ 5 ]
[ 6 ]

34. Binary Search
Efficiency of binary search



35. Binary Search
Efficiency of binary search
# of namesMaximum sequential searches necessaryMaximum binary searches necessary1010410010071,0001,000105,0005,0001310,00010,0001450,00050,00016100,000100,000171,000,0001,000,0002010,000,00010,000,000241,000,000,0001,000,000,00030

36. Binary Search

37. References


