Update Solution Exercise 4 - Bubble sort.cpp

Part 1/5. Arrays/Solutions/Solution Exercise 4 - Bubble sort.cpp

@@ -2,45 +2,38 @@
 
 using namespace std;
 
-int main ()
-{
-	int a [10] , i , zw , change ;
-
-	cout << "Unsorted: ";
-	for ( i =0; i <10; i ++)
-	{
-		a [i] = rand()%100;
-		cout << a [i] << " ";
-	}
-
-	// sorting (output of the intermediate steps while sorting…)
-	do
-	{
-		cout << endl << "Intermediate step: ";
-		change=0; // No swapping necessary
-		for (i=0; i<9; i++)
-			if ( a [i] > a [i+1])
-			{
-				zw = a[i];
-				a[i] = a[i+1];
-				a[i+1] = zw;
-				change = 1; // Swapping
-			}
-
-		for (i=0; i<10; i++) 
-			cout << a [i] << " ";
-	}
-	while (change);
-
-	cout << endl;
-
-	cout << "Sorted: ";
-	for ( i =0; i <10; i ++)
-	{
-		cout << a [i] << " ";
-	}
-
-	cout << endl;
-
-	return 0;
+int main() {
+    int a[10], i, zw, change;
+
+    cout << "Unsorted: ";
+    for (i = 0; i < 10; i++) {
+        a[i] = rand() % 100;
+        cout << a[i] << " ";
+    }
+
+    // sorting (output of the intermediate steps while sorting…)
+    do {
+        cout << endl << "Intermediate step: ";
+        change = 0;  // No swapping necessary
+        for (i = 0; i < 9; i++)
+            if (a[i] > a[i + 1]) {
+                zw = a[i];
+                a[i] = a[i + 1];
+                a[i + 1] = zw;
+                change = 1;  // Swapping
+            }
+
+        for (i = 0; i < 10; i++) cout << a[i] << " ";
+    } while (change);
+
+    cout << endl;
+
+    cout << "Sorted: ";
+    for (i = 0; i < 10; i++) {
+        cout << a[i] << " ";
+    }
+
+    cout << endl;
+
+    return 0;
 }