The document discusses three sorting algorithms: bubble sort, selection sort, and merge sort. Bubble sort compares adjacent elements and swaps them if they are in the wrong order. Selection sort finds the minimum element and places it in the first position, then repeats for remaining elements. Merge sort divides the array into halves, recursively sorts them, and then merges the sorted halves into a single sorted array. The document provides pseudocode to illustrate the algorithms.

3. Group no. 6
• Shoaib Manzoor 23
• Mureed Hussain 43
• Muhammad Sajjad 24
• Jahanzeb Shaukat 46
• Usman Nasir 12

4. SORTING

5. What is sorting?
The process in which we arrange collection
of items in ascending or descending order is
called sorting.

6. Types of sorting
There are many kinds of sorting but here we
will discuss only three types:
• Bubble Sort
• Selection Sort
• Merge Sort

7. Bubble Sort
Shoaib Manzoor

8. Algorithm
• for I=1 to n
• for j=1 to N-I
• if list[j] > list[j+1]
• swap(list[j], list[j+1])

9. Source Code (C++)
Void main(int list[10])
{
for(int i = 0 ; i < 10 ; i++)
{
for (int j = 0 ; j < i ; j++)
{
if (list[j] > list [j + 1])
{
m = list[j];
list[j] = list[j+ 1]
list[j + 1] = m;
}
}
}
}

10. Selection Sort
Mureed Hussain

11. • The selection sort is a combination of searching and
sorting.
• In selection sort, sorting is done after selecting a
particular smallest or largest element from an array
and shifted it to a particular location in an array.
• During each pass, the unsorted element with the
smallest (or largest) value is moved to its proper
position in the array.
• Let's look at our same table of elements using a
selection sort for ascending order:

12. Array 40 50 60 10 30 20
1-pass 10 50 60 40 30 20
2-pass 10 20 60 40 30 50
3-pass 10 20 30 40 60 50
4-pass 10 20 30 40 60 50
5-pass 10 20 30 40 50 60
• The number of times the sort passes through the
• In the selection sort, the inner loop finds the next
smallest (or largest) value and the outer loop places that
value into its proper location.
• Lets watch a visualizer which will give you a basic idea
of a selection sort.
• Please co-operate.

13. Algorithm
For (i=1 to n)
m = i
for j = i+1 to n
if list[j] < list[m]
m=j
if m != j
swap(list[i] , list[m])

14. MERGE SORT
Muhammad Sajjad
& Usman Nasir

15. Algorithm
Function merge_sort(list)
if length of list < 2
return list
left = empty list
right = empty list
m = length of list / 2
for i = 1 to m
append list i to left
for j = m + 1 to length of list
append list j to right
return merge (merge_sort(left));
merge _sort (right)

16. function merge ( left , right )
i = 1
j = 1
result = empty list
while i <= length of left
and j <= length of right
if left i < right j
append left i to result
i = i +1
else
append right j to result
j = j + 1
for k = i to length of left
append left k to result
for k = j to length of right
append right k to result
return result

18. Thank You