quick sort and binary search pdf

INFORMATION AND TECHNOLOGY Branch Code : 016 Data Structures Subject code : 2130702

Presentation on

Quick Sort and Binary Search

Data Structure

Quick Sort and Binary Search

INDEX

Quick Sort

Binary Search

Summary

References

1

2

3

4

Quick Sort

Graphical Representation

Quick Sort

Quicksort Concept

(<pivot) LEFT group

(> pivot) RIGHT group

apply Quicksort to the subgroups

Quick Sort

Quicksort Start

Unsorted Array

Quick Sort

Quicksort Step 1

26 33 35 29 19

pivot

12 22

Quick Sort

Quicksort Step 2

26 33 35 29 19

left

pivot

12 22

right

Quick Sort

Quicksort Step 3

26 33 35 29 19

left

pivot

12 22

right

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

Quick Sort

Quicksort Step 5

left

26 22 35 29 19

left

pivot

12 33

right

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

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

Quick Sort

Quicksort Step 8

26 22 12 19 29

left

pivot

35 33

right

26 19 22 12 29

pivot

35

LEFT RIGHT

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

Quick Sort

Quicksort Efficiency

Quick Sort

Best Case

Quick Sort

Worst case

Quick Sort

Worst case for quicksort

Binary Search

Problem: Search

Binary Search

Search [ 0 ] [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 700 ]

Number 506643548 Number 233667136 Number 281942902

Number 155778322 Number 580625685 Number 701466868 …

Number 580625685

Binary Search

Binary Search

Binary Search

Binary Search

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Example

[ 0 ] [ 1 ]

3 6 7 11 32 33 53

[ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ]

Binary Search

Efficiency of binary search

Binary Search

Efficiency of binary search

# of names

Maximum sequential

searches necessary

Maximum binary

searches necessary

10 10 4

100 100 7

1,000 1,000 10

5,000 5,000 13

10,000 10,000 14

50,000 50,000 16

100,000 100,000 17

1,000,000 1,000,000 20

10,000,000 10,000,000 24

1,000,000,000 1,000,000,000 30

Binary Search

References