University:
College
Course:
College Computer Science
Academic year:

2023
Views:

5

Pages:

25
Author:

priyankavaiya07

Sorting Bubble Sort In bubble sort, each element is compared with it's adjacent element. If the first element is larger than the second one, then the positions of the elements are interchanged, otherwise, it is not changed. Then next element is compared with it's adjacent element and the same process is repeated for all the elements in the list. Algorithm 1. Input n numbers to an array A 2. Initialize i=0 and repeat through step 4 if(I < n) 3. Initialize j=0 and repeat through step 4 if(j < n-1-1) 4. if(A[j]>A[j+1]) - Temp=A[j] A[j]=A[j+1] = A[j+1]=Temp 5. Display the sorted list 6. Exit Selection Sort The selection sort algorithm sorts an array by repeatedly finding the minimum element (considering ascending order) from unsorted part and putting it at the beginning Insertion Sort Step 1: The second element of an array is compared with the elements that appears before it (only first element in this case). If the second element is smaller than first element, second element is inserted in the position of first element. After first step, first two elements of an array will be sorted. Step 2: The third element of an array is compared with the elements that appears before it (first and second element). If third element is smaller than first element, it is inserted in the position of first element. If third element is larger than first element but, smaller than second element, it is inserted in the position of second element. If third element is larger than both the elements, it is kept in the position as it is. After second step, first three elements of an array will be sorted. Step 3: Similarly, the fourth element of an array is compared with the elements that appears before it (first, second and third element) and the same procedure is applied and that element is inserted in the proper position. After third step, first four elements of an array will be sorted.