Skip to main content

Bubble sort

 Bubble sort




 Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The pass through the list is repeated until no swaps are needed, which indicates that the list is sorted. The algorithm, which is a comparison sort, is named for the way smaller elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sort order but may occasionally have some out-of-order elements nearly in position.

 Bubble sort has worst-case and average complexity both О(n2), where n is the number of items being sorted. There exist many sorting algorithms with substantially better worst-case or average complexity of O(n log n). Even other О(n2) sorting algorithms, such as insertion sort, tend to have better performance than bubble sort. Therefore, bubble sort is not a practical sorting algorithm when n is large.
The only significant advantage that bubble sort has over most other implementations, even quicksort, but not insertion sort, is that the ability to detect that the list is sorted is efficiently built into the algorithm. When the list is already sorted (best-case), the complexity of bubble sort is only O(n). By contrast, most other algorithms, even those with better average-case complexity, perform their entire sorting process on the set and thus are more complex. However, not only does insertion sort have this mechanism too, but it also performs better on a list that is substantially sorted (having a small number of inversions).
Bubble sort should be avoided in the case of large collections. It will not be efficient in the case of a reverse-ordered collection.   
source wikipedia


Comments

Post a Comment

Popular posts from this blog

Convert numbers to roman numerals

Convert numbers to roman numerals       #include <stdio.h> #include <conio.h> void predigits (char c1,char c2); void postdigits (char c,int n); char roman_Number[1000]; int i=0; int main() {     int j;     long int number;        printf( "Enter any natural number: " );     scanf( "%d" ,&number);        if (number <= 0) {          printf("Invalid number");          return 0;     }     while (number != 0){          if (number >= 1000){              postdigits('M',number/1000);              number = number - (number/1000) * 1000;          } ...
Post a Comment
Read more

To Find Factorial of a Number

To Find Factorial of a Number   Factorial of a Number   For any positive number n , its factorial is given by: factorial = 1 * 2 * 3 * 4. ... n If a number is negative, factorial does not exist and factorial of 0 is 1. This program takes an integer from a user. If user enters negative integer, this program will display error message and if user enters non-negative integer, this program will display the factorial of that number. Source Code /* C program to display factorial of an integer if user enters non-negative integer. */ #include <stdio.h> int main () { int n , count ; unsigned long long int factorial = 1 ; /* you can only write int */ printf ( "\nEnter an integer: \n" ); scanf ( "%d" ,& n ); if ( n < 0 ) printf ( "\nError!!! Factorial of negative number doesn't e...
Post a Comment
Read more

Matchstick Game using C Programming

Matchstick Game using C Programming Write a program for a matchstick game being played between the computer and a user. Your program should ensure that the computer always wins. Rules for the game are as follows: -There are 21 matchsticks. -The computer asks the player to pick 1, 2, 3 or 4 matchsticks. -After the person picks, the computer does its picking. -Whoever is forced to pick up the last matchstick loses the game. -There are 21 matchsticks. -Whoever is forced to pick up the last matchstick loses the game. So the last one is special, so it's all about how to get rid of 20 matches in pairs of turns. -The computer asks the player to pick 1, 2, 3 or 4 matchsticks. So if we reduce the total by 5 each round, the sequence will go 21 16 11 6 1 In effect, whatever number the user picks (n), the computer picks 5-n #include <stdio.h> main ( ) { int matchsticks = 21 , user , computer ; printf ( "Do not enter Invalid Numbers. \...
Post a Comment
Read more