Professional Documents
Culture Documents
DS Unit-5 Searching-Sorting
DS Unit-5 Searching-Sorting
GTU # 3130702
Unit-5
Searching & Sorting
Sorting & Searching
Searching
Linear/Sequential Search
Binary Search
Sorting
Bubble sort
Selection Sort
Insertion Sort
Quick Sort
Merge Sort
2 9 3 1 8 2 9 3 1 8
i i
Element found at ith index, i=3
-1 5 6 18 19 25 46 78 102 114
Index 0 1 2 3 4 5 6 7 8 9
left right
Key=6, No of Elements = 10, so left = 0, right=9
Step 1: middle index = (left + right) /2 = (0+9)/2 = 4
middle element value = a[4] = 19
Key=6 is less than middle element = 19, so right = middle – 1 = 4 – 1 = 3, left = 0
-1 5 6 18 19 25 46 78 102 114
Index 0 1 2 3 4 5 6 7 8 9
left right
-1 5 6 18 19 25 46 78 102 114
Index 0 1 2 3 4 5 6 7 8 9
left right
Step 3: middle index = (left + right) /2 = (2+3)/2 = 2
middle element value = a[2] = 6
Key=6 is equals to middle element = 6, so element found
-1 5 6 18 19 25 46 78 102 114
Index 0 1 2 3 4 5 6 7 8 9
Element Found
The smallest element is selected from the unsorted array and swapped with the leftmost
element, and that element becomes a part of the sorted array.
This process continues moving unsorted array boundary by one element to the right.
This algorithm is not suitable for large data sets as its average and worst case complexities
are of Ο(n2), where n is the number of items.
Step 1 :
Unsorted Array
5 1 12 -5 16 2 12 14
0 1 2 3 4 5 6 7
Step 2 :
Unsorted Array (elements 0 to 7) Min index = 0, value = 5
-5
5 1 12 -5
5 16 2 12 14 Find min value from
Unsorted array
0 1 2 3 4 5 6 7
Index = 3, value = -5
Swap
Step 4 :
Unsorted Array
(elements 2 to 7)
Min index = 2, value = 12
-5 1 12
2 5 16 12
2 12 14 Find min value from
0 1 2 3 4 5 6 7 Unsorted array
Index = 5, value = 2
Swap
Step 6 :
Unsorted Array
(elements 5 to 7)
Min index = 4, value = 16
-5 1 2 5 12
16 16
12 12 14 Find min value from
0 1 2 3 4 5 6 7 Unsorted array
Index = 5, value = 12
Swap
-5 1 2 5 12 12
16 16
12 14 Find min value from
0 1 2 3 4 5 6 7 Unsorted array
Index = 6, value = 12
Swap
Step 8 :
Unsorted Array
(elements 6 to 7)
Min index = 6, value = 16
-5 1 2 5 12 12 14
16 16
14 Find min value from
0 1 2 3 4 5 6 7 Unsorted array
Index = 7, value = 14
Swap
34
45 34 34 34 34 34 34 23
34 23 12
23
swap
swap
swap
34
45 45 45 45 45 45
23 23 23
34 34
12 12
23
swap
swap
56 56 56
23 23 23 23
45 45
12 12 12
34 34
swap
swap
23 23 23
56 56
12 12 12 12
45 45 45 45
swap
12 12 12 12
56 56 56 56 56 56 56
Quick sort partitions an array and then calls itself recursively twice to sort the two resulting sub
arrays.
This algorithm is quite efficient for large-sized data sets
Its average and worst case complexity are of Ο(n2), where n is the number of items.
We are considering first element as pivot element, so Lower bound is First Index and Upper
bound is Last Index
We need to find our proper position of Pivot element in sorted array and perform same
operations recursively for two sub array
Pivot
Element
0 1 2 3 4 5 6 7 8 9
42 23 74 11 65 58 94 36 99 87
LB UB
0 1 2 3 4 5 6 7
724 521 2 98 529 31 189 451
0 1 0 1 0 1 0 1
724 521 2 98 529 31 189 451
0 0 0 0 0 0 0 0
724 521 2 98 529 31 189 451
6 5 3 1 8 7 2 4
Pass - 1 : Select First Record and considered as Sorter Sub-array
6 5 3 1 8 7 2 4
Sorted Unsorted
Pass - 2 : Select Second Record and Insert at proper place in sorted array
6 5 3 1 8 7 2 4
5 6 3 1 8 7 2 4
Sorted Unsorted
5 6 3 1 8 7 2 4
3 5 6 1 8 7 2 4
Sorted Unsorted
Pass - 4 : Select Forth record and Insert at proper place in sorted array
3 5 6 1 8 7 2 4
1 3 5 6 8 7 2 4
Sorted Unsorted
#3130702 (DS) Unit 5 – Searching & Sorting 34
Insertion Sort Example Cont.
Pass - 5 : Select Fifth record and Insert at proper place in sorted array
1 3 5 6 8 7 2 4
8 is at proper position
1 3 5 6 8 7 2 4
Sorted Unsorted
Pass - 6 : Select Sixth Record and Insert at proper place in sorted array
1 3 5 6 8 7 2 4
1 3 5 6 7 8 2 4
Sorted Unsorted
#3130702 (DS) Unit 5 – Searching & Sorting 35
Insertion Sort Example Cont.
Pass - 7 : Select Seventh record and Insert at proper place in sorted array
1 3 5 6 7 8 2 4
1 2 3 5 6 7 8 4
Sorted Unsorted
Pass - 8 : Select Eighth Record and Insert at proper place in sorted array
1 2 3 5 6 7 8 4
1 2 3 4 5 6 7 8
Sorted Unsorted
#3130702 (DS) Unit 5 – Searching & Sorting 36
Data Structures (DS)
GTU # 3130702
Thank
You