Sorting Algorithms
Sorting: In the data structure, sorting is the process by which you arrange the data in a logical order. This logical order can also be an ascending order or a descending order.
Sorting is related to searching. We search for many things in our life, such as a topic on google, a page in the book, a word in the dictionary, and roll number in the exam hall. Therefore, all these things that happen are sorted so that we can easily search them.
Types of sorting
There are two types of sorting in the data structure:
- Internal sorting
- External sorting
Internal sorting: The data to be sorted in this sorting resides in the main memory. There are the following types of internal sorting.
- Bubble sort
- Insertion sort
- Quick sort
- Heap sort
- Selection sort
External sorting: The data to be sorted in this sorting resides in secondary memory. There is so much data in this sorting that it cannot enter the main memory. There is only one type of external sorting called merge sort.
Bubble sort
Bubble sort is a very easy sorting technique. It compares all the elements one by one. It sorts them based on their values. In this, the two elements of the beginning are compared. If the first element is larger than the second element, it will change both elements' location, and this comparison will go on till the end.
Complexity table of bubble sort
| Complexity | Best case | Average case | Worst case |
| Time | O(n) | O(n2) | O(n2) |
| Space | O(1) |
Algorithm of bubble sort
The following algorithm is used to implement a bubble sort.
| Bubble_Sort(A) Step 1: Repeat Step 2 and 3 for i = 1, 2….to n-1 Step 2: set j = 1 Step 3: Repeat while (j < n - i) { if (A[j] > A[j + 1]) swap A[j] and A[j + 1] j = j + 1 } // end of while loop // end of for loop Step 4: exit |
For example: Let’s consider an array A{8. 14, 6, 7, 32, 15}.
| 8 14 6 7 32 15 First iteration Step 1: Compare the first two elements, 8 < 14. No interchange 8 14 6 7 32 15 Step 2: Compare the second and third elements, 14 > 6. The second element is larger than the third element, so it will swap the elements. 8 6 14 7 32 15 Step 3: Compare the third and fourth elements, 14 > 7. The third element is larger than the fourth element, so it will swap the elements. 8 6 7 14 32 15 Step 4: Compare the fourth and fifth elements, 14 < 32. No interchange 8 6 14 7 32 15 Step 5: Compare the fifth and sixth elements, 32 > 15. The fifth element is larger than the sixth element, so it will swap the elements. 8 6 14 7 15 32 The first iteration is completed. Similarly, all iterations will be performed. |
Bubble sort program in C language.
#include<stdio.h>
void main ()
{
int i, j,temp;
int a[10] = {8, 7, 9, 1, 3, 2, 5, 10, 6, 4};
for(i = 0; i<10; i++)
{
for(j = i+1; j<10; j++)
{
if(a[j] > a[i])
{
temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}
printf("Bubble sort list\n");
for(i = 0; i<10; i++)
{ printf("%d\n",a[i]); }
}
Output:
Bubble sort list 1 2 3 4 5 6 7 8 9 10
Bubble sort program in java language
class BubbleSort
{
void bubbleSort(int arr[])
{
int n = arr.length;
for (int i = 0; i < n-1; i++)
for (int j = 0; j < n-i-1; j++)
if (arr[j] > arr[j+1])
{ // swap arr[j+1] and arr[i]
int temp = arr[j];
arr[j] = arr[j+1];
arr[j+1] = temp;
}
} /* Prints the array */
void printArray(int arr[])
{ int n = arr.length;
for (int i=0; i<n; ++i)
System.out.print(arr[i] + " ");
System.out.println();
} // Driver method to test above
public static void main(String args[])
{
BubbleSort ob = new BubbleSort();
int arr[] = {8, 7, 9, 1, 3, 2, 5, 10, 6, 4};
ob.bubbleSort(arr);
System.out.println("Bubble sort list");
ob.printArray(arr); } }
Output:
Bubble sort list 1 2 3 4 5 6 7 8 9 10