How do you do bubble sort in C programming?

Answer 1

Bubble sort, also known as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping 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 gets its name from the way smaller elements "bubble" to the top of the list. Because it only uses comparisons to operate on elements, it is a comparison sort. Although the algorithm is simple, it is not efficient for sorting large lists; other algorithms are better.

Answer 2

#include <stdio.h>

int main()

{

int array[100], n, i, j, temp;

printf("Enter number of elements\n");

scanf("%d", &n);

printf("Enter %d integers\n", n);

for (i = 0; i < n; i++)

scanf("%d", &array[i]);

for (i = 0 ; i < ( n - 1 ); i++)

{

for (j = 0 ; j < n - i - 1; j++)

{

if (array[j] > array[j+1]) /* For decreasing order use < */

{

temp = array[j];

array[j] = array[j+1];

array[j+1] = temp;

}

}

}

printf("Sorted list in ascending order:\n");

for ( i = 0 ; i < n ; i++ )

printf("%d\n", array[i]);

return 0;

}

Answer 3

Theory of Algorithms

15-01-2004

Heapsort - Sebastian Streich, Enric Meinhardt 8

Subroutines for Heaps

Heapify(A,i)

l := largest node of i and its children

if ( i ≠ l )

exchange A[i] with A[l]

Heapify(A, l)

A real implementation should not be recursive!

(overhead when passing the function's arguments)

Answer 4

for(i=0;i<size;i++)

{

flag=0;

for(j=0;j<size-i-1;j++)

{

if(a[j]>a[j+1])

{

flag=1;

temp=a[j];

a[j]=a[j+1];

a[j+1]=temp;

}

if(flag==0)

break;

}

}

Answer 5

using System.Linq;

myArray.OrderBy(s=>s).ToArray();

or

myArray.OrderByDescending(s=>s).ToArray();