Update Solution Exercise 3 - Sort.cpp

Part 1/5. Arrays/Solutions/Solution Exercise 3 - Sort.cpp

@@ -4,41 +4,34 @@ using namespace std;
 
 void sort(string[], int);
 
-int main()
-{
-	int number = 5;
-	string names[number];
-	cout << "Please enter 5 names:" << endl;
-	int i = 0;
-	for (i = 0; i < 5; i++) 
-	{
-		cout << "Name " << i+1 << ": ";
-		cin >> names[i];
-	}
-	cout << "...... OUTPUT IN AN ALPHABETICAL ORDER ......" << endl;
-	sort(names, number);
+int main() {
+    int number = 5;
+    string names[number];
+    cout << "Please enter 5 names:" << endl;
+    int i = 0;
+    for (i = 0; i < 5; i++) {
+        cout << "Name " << i + 1 << ": ";
+        cin >> names[i];
+    }
+    cout << "...... OUTPUT IN AN ALPHABETICAL ORDER ......" << endl;
+    sort(names, number);
 
-	return 0;
+    return 0;
 }
 
-void sort(string names[], int size) 
-{
-	string tmp_name = "";
-	for (int i = 0; i < size - 1; i++) 
-	{
-		for (int j = i+1; j < size; j++) 
-		{
-			if (names[i] > names[j]) 
-			{
-				tmp_name = names[i];
-				names[i] = names[j];
-				names[j] = tmp_name; 
-			}
-		} 
-	}
-	
-	for (int k = 0; k < size; k++) 
-	{
-		cout << names[k] << endl; 
-	}
+void sort(string names[], int size) {
+    string tmp_name = "";
+    for (int i = 0; i < size - 1; i++) {
+        for (int j = i + 1; j < size; j++) {
+            if (names[i] > names[j]) {
+                tmp_name = names[i];
+                names[i] = names[j];
+                names[j] = tmp_name;
+            }
+        }
+    }
+
+    for (int k = 0; k < size; k++) {
+        cout << names[k] << endl;
+    }
 }