From ceee15943e4cb892c2a144e1abb0346eee09d84a Mon Sep 17 00:00:00 2001
From: PARISOT paul andrea <parisotp@informatique.univ-paris-diderot.fr>
Date: Mon, 16 Apr 2018 17:14:45 +0200
Subject: [PATCH]  Implementation of the OddEven sorting algorithm

---
 Sorting/OddEven_Sort.cpp | 68 ----------------------------------------
 1 file changed, 68 deletions(-)
 delete mode 100644 Sorting/OddEven_Sort.cpp

diff --git a/Sorting/OddEven_Sort.cpp b/Sorting/OddEven_Sort.cpp
deleted file mode 100644
index 790d391a5..000000000
--- a/Sorting/OddEven_Sort.cpp
+++ /dev/null
@@ -1,68 +0,0 @@
-/* C++ implementation Odd Even Sort */
-#include<iostream>
-using namespace std;
-
-void switchElmts(int arr[], int i, int j)
-{
-	int tmp = arr[i];
-	arr[i] = arr[j];
-	arr[j] = tmp;
-}
-
-void oddEven(int arr[], int size)
-{
-	bool sorted = false;
-	while(!sorted)
-	{
-		sorted = true;
-		for(int i = 1; i < size-1; i += 2)//Odd
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-
-		for(int i = 0; i < size-1; i += 2)//Even
-		{
-			if(arr[i] > arr[i+1])
-			{
-				switchElmts(arr,i,i+1);
-				sorted = false;
-			}
-		}
-	}
-}
-
-void show(int A[], int size)
-{
-	int i;
-	for (i = 0; i < size; i++)
-	cout<<A[i]<<"\n";
-}
-
-
-int main()
-{
-	int size;
-	cout<<"\nEnter the number of elements : ";
-
-	cin>>size;
-
-	int arr[size];
-
-	cout<<"\nEnter the unsorted elements : ";
-
-	for (int i = 0; i < size; ++i)
-	{
-		cout<<"\n";
-		cin>>arr[i];
-	}
-
-	oddEven(arr, size);
-
-	cout<<"Sorted array\n";
-	show(arr, size);
-	return 0;
-}