Sorting and Its Types

SORTING
Sorting refers to operations of
arranging a set of data in a given
order.
10 20 30 40 50 60
30 10 60 20 50 40 Unsorted List
Sorted List

BASIC TYPES :
Internal Sorting:
If all the data to be sorted can be
adjusted in main memory then it is
called as Internal Sorting.
External Sorting:
If data to be stored is large and aquires
external memory then the type is called
as External Sorting.

METHODS OF SORTING:
Bubble Sort
Selection Sort
Insertion Sort

ALGORITHM
Bubble Sort:
Algorithm of bubble sort includes two steps
repeated until the list is sorted.
 Compare adjacent elements, if the
element on right side is smaller then
swap their positions.
 Compare first element, second element
and so on on completion of Pass 1 the
largest element is at last position.

Pass 1:
50 10 20 30 40
50 10 20 30 40
10 50 20 30 40
10 20 50 30 40
10 20 30 50 40
10 20 30 40 50
0,1
1,2
2,3
3,4
Number Of Passes = Max – 1 = 5 – 1 = 4
SORTED LIST

ALGORITHM
Selection Sort:
Here in selection sort the algorithm depends on the
zeroth element majorly.
 The Zeroth element is compared with the first
element and if the element at right is found smaller
then their positions are swapped or exchanged.
 The same procedure is carried with all elements of
the list resulting into a fully sorted list.

23 15 29 11 1
23 15 29 11 1
Pass
1:
Number Of Passes = Max – 1 = 5 – 1 = 4
15 23 29 11 1
15 23 29 11 1
11 23 29 15 1
1 23 29 15 11
0,1
0,2
0,3
0,4

1 23 29 15 11
Pass 2:
1 29 23 15 11
1 15 23 29 11
1 11 23 29 15
1,2
1,3
1,4

1 11 23 29 15
Pass 3:
1 11 23 29 15
1 11 15 29 23
2,3
2,4

Pass 4:
1 11 15 29 23
1 11 15 23 29
1 11 15 23 29 Sorted List
3,4

Mathematical applications : in the search for
greater value, or the smallest value. In
many other applications.
This method is effective when dealing
with small numbers .

ALGORITHM
Insertion Sort
In insertion sort the elements are compared
and inserted to respective index place.
 It starts with comparision of 1st and 0th
element in pass 1.
 In pass 2 the second element is compared
with the 1st and 0th element.
 Doing so with all the elements in the list
appropriate element is inserted by shifting
elements on right.

75 57 25 19 4
Pass 1: Number Of Passes = Max – 1 = 5 – 1 = 4
57 75 25 19 4
75 57 25 19 4 0,1

Pass 2:
57 75 25 19 4
25 57 75 19 4
0,2

Pass 3:
25 57 75 19 4
19 25 57 75 4
0,3

4 19 25 57 75
Pass 4:
19 25 57 75 4 0,4

Sorting and Its Types

More Related Content

What's hot (20)

Similar to Sorting and Its Types (20)

More from amberkhan59 (7)

Recently uploaded (20)

Sorting and Its Types