Interview Preparation Bubble Sort - Revision history

Proj user18 at 13:11, 25 November 2016

2016-11-25T13:11:53Z

Proj user18 at 13:11, 25 November 2016

2016-11-25T13:11:11Z

Proj user18 at 13:02, 25 November 2016

2016-11-25T13:02:23Z

Proj user18 at 12:54, 25 November 2016

2016-11-25T12:54:11Z

Proj user18 at 12:48, 25 November 2016

2016-11-25T12:48:24Z

Proj user18 at 12:17, 25 November 2016

2016-11-25T12:17:52Z

Proj user18: Created page with "I think this ia a simplest sorting algorithm for implementation. Algorithm for placing an array of elements n in an ascending order is listed below, a. Begin from the first..."

2016-11-25T12:03:06Z

Created page with "I think this ia a simplest sorting algorithm for implementation. Algorithm for placing an array of elements n in an ascending order is listed below, a. Begin from the first..."

New page

I think this ia a simplest sorting algorithm for implementation.
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 2 for n-1 iteration.
d. Repeat step b and C for n-1 times.

Similar algorithm can be framed for placing elements in descending order with minute changes.

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

@@ Line 13: / Line 13: @@
 '''Code Snippet'''
 <pre>
-	for(l = 0 ; l < Elecount ; l++)
+for(l = 0 ; l < Elecount ; l++)
+	{
-		for(j = 0; j < Elecount-l-1; j++)
+		if(array[j] > array[j+1])
+		{
-			if(array[j] > array[j+1])
+			temp = array[j];
+			array[j] = array[j+1];
-				temp = array[j];
+			array[j+1] = temp;
+		}
 	}</pre>
 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).

← Older revision		Revision as of 13:02, 25 November 2016
Line 11:		Line 11:


−	Similar to above algorithm, Algorithm for placing an array of elements n in descending order can be formulated with minute changes.	+	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).		For an array with n number of elements. Worst case complexity = О(n^2) and average complexity = О(n^2).

@@ Line 6: / Line 6: @@
 b. If the element at smaller index is greater swap the element.
-c. Increment the index by one and repeat step 2 for n-1 iteration.
+c. Increment the index by one and repeat step 'b' for n-1 iteration.
 d. Repeat step b and C for n-1 times.

@@ Line 1: / Line 1: @@
-I think this ia a simplest sorting algorithm for implementation.
+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,
@@ Line 11: / Line 11: @@
-Similar algorithm can be framed for placing elements in descending order with minute changes.
+Similar to above algorithm, Algorithm for placing an array of elements n 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).