{"post":"

Bubble Sort

It is also a simple sorting algorithm. It repeatedly compares two items at a time and swapping them in ascending or descending order. The process keeps repeating itself until there are no more swaps needed.

Bubble sort has a complexity of O(n²), where n is number of items being sorted, so we should avoid using bubble sort when n is large.

$\"\"$

Swfung8 / CC BY-SA

# Algorithm

//bubble sort\nvoid sort(Student st[], int n){\nstudent temp;\nfor (int i = 0; i < n; i++){\nfor (int j = 0; j < n; j++){\nif (st[j].Marks < st[j + 1].Marks){\ntemp = st[j];\nst[j] = st[j + 1];\nst[j + 1] = temp;\n}\n}\n}\n}

Code:

#include<stdio.h>\nint main(){
\nint count, temp, i, j, number[30];
\nprintf(\"How many numbers are u going to enter?: \");\nscanf(\"%d\",&count);
\nprintf(\"Enter %d numbers: \",count);
\nfor(i=0;i<count;i++)\nscanf(\"%d\",&number[i]);
\nfor(i=count-2;i>=0;i--){\nfor(j=0;j<=i;j++){\nif(number[j]>number[j+1]){\ntemp=number[j];\nnumber[j]=number[j+1];\nnumber[j+1]=temp;\n}\n}\n}
\nprintf(\"Sorted elements: \");\nfor(i=0;i<count;i++)\nprintf(\" %d\",number[i]);
\nreturn 0;\n}

\n","title":"Bubble Sort in C","authorDetails":{"name":"Sonal Moga","slug":"sonal-moga"},"description":"Bubble sort pogram in c with code and algorithm. In Bubble sort we repeatedly compare two items at a time and swapping them in ascending or descending order.","slug":"data-structure/bubble-sort/","articleId":"636a83417bb1ce5072622b2c","bookmarkStatus":{"isBookmarked":false,"bookmarkId":null}}