Update OddEven Sort.cpp

Sorting/OddEven Sort.cpp

@@ -1,15 +1,10 @@
 /* C++ implementation Odd Even Sort */
 #include <iostream>
+#include <vector>
+
 using namespace std;
 
-void switchElmts(int arr[], int i, int j)
+void oddEven(vector<int> &arr, int size)
-{
-	int tmp = arr[i];
-	arr[i] = arr[j];
-	arr[j] = tmp;
-}
-
-void oddEven(int arr[], int size)
 {
 	bool sorted = false;
 	while( ! sorted )
@@ -19,7 +14,7 @@ void oddEven(int arr[], int size)
 		{
 			if(arr[i] > arr[i+1])
 			{
-				switchElmts(arr,i,i+1);
+				swap(arr[i], arr[i+1]);
 				sorted = false;
 			}
 		}
@@ -28,14 +23,14 @@ void oddEven(int arr[], int size)
 		{
 			if(arr[i] > arr[i+1])
 			{
-				switchElmts(arr,i,i+1);
+				swap(arr[i], arr[i+1]);
 				sorted = false;
 			}
 		}
 	}
 }
 
-void show(int A[], int size)
+void show(vector<int> A, int size)
 {
 	int i;
 	for (i = 0; i < size; i++)
@@ -45,19 +40,18 @@ void show(int A[], int size)
 
 int main()
 {
-	int size;
+	int size, temp;
 	cout << "\nEnter the number of elements : ";
-
 	cin >> size;
 
-	int arr[size];
+	vector<int> arr;
 
-	cout<<"\nEnter the unsorted elements : ";
+	cout<<"\nEnter the unsorted elements : \n";
 
 	for (int i = 0; i < size; ++i)
 	{
-		cout<<"\n";
+		cin >> temp;
-		cin>>arr[i];
+		arr.push_back(temp);
 	}
 
 	oddEven(arr, size);