Bubble Sort Algorithm in C
Bubble Sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent items, and swaps them if they are in the wrong order. The process is repeated until the list is sorted. The algorithm gets its name because smaller elements "bubble" to the top of the list (beginning), while larger elements "sink" to the bottom (end).The space complexity of Bubble Sort is O(1)O(1) because it is an in-place sorting algorithm, meaning it does not require any additional memory aside from the input array.It is simple and easy to understand, but inefficient for large datasets.
You can get the complete code from Github
Bubble Sort Algorithm Steps:
1. Start from the first element of the list.
2. Compare the current element with the next one.
3. If the current element is greater than the next one, swap them.
4. Move to the next pair of adjacent elements and repeat the comparison and swapping process.
5. After completing one full pass through the list, the largest element will be at the end.
6. Repeat the process for the remaining unsorted part of the list (ignore the last element since it's already sorted).
7. Continue until no more swaps are needed, indicating that the list is sorted.
bubblesort.c
1 #include<stdio.h>
2 int main() {
3 int Arr[] = {43,45,98,23,21,5,1,8,2,6,77,18,4};
4 int n = sizeof(Arr)/sizeof(Arr[0]);
5 int i,j,s;
6
7 printf("Before Sort:\n");
8 for(i = 0;i < n;i++) {
9 printf("%d ",Arr[i]);
10 }
11 printf("\n");
12
13 for(i = 0;i < n;i++) {
14 for(j = i+1;j < n;j++) {
15 if(Arr[i] > Arr[j]) {
16 s = Arr[i];
17 Arr[i] = Arr[j];
18 Arr[j] = s;
19 }
20 }
21 }
22
23 printf("After Sort:\n");
24 for(i = 0;i < n;i++) {
25 printf("%d ",Arr[i]);
26 }
27 printf("\n");
28
29 return 0;
30 }