Interview Preparation Bubble Sort

I think this is simplest sorting algorithm among all other sorting algorithms. Algorithm for placing an array of elements n in an ascending order is listed below,

a. Begin from the first element and start comparing two elements.

b. If the element at smaller index is greater swap the element.

c. Increment the index by one and repeat step 'b' for n-1 iteration.

d. Repeat step b and C for n-1 times.

Code Snippet

	for(l = 0 ; l < Elecount ; l++)
	{
		for(j = 0; j < Elecount-l-1; j++)
		{
			if(array[j] > array[j+1])
			{
				temp = array[j];
				array[j] = array[j+1];
				array[j+1] = temp;
			}
		}
	}

Similar to above algorithm, Algorithm for placing an array of 'n' elements in descending order can be formulated with minute changes.

For an array with n number of elements. Worst case complexity = О(n^2) and average complexity = О(n^2).