Added exchange sort (keon#816)

* add_exchange_sort

Author: Kim-AYoung

README.md

@@ -283,6 +283,7 @@ If you want to uninstall algorithms, it is as simple as:
  - [comb_sort](algorithms/sort/comb_sort.py)
  - [counting_sort](algorithms/sort/counting_sort.py)
  - [cycle_sort](algorithms/sort/cycle_sort.py)
+ - [exchange_sort](algorithms/sort/exchange_sort.py)
  - [gnome_sort](algorithms/sort/gnome_sort.py)
  - [heap_sort](algorithms/sort/heap_sort.py)
  - [insertion_sort](algorithms/sort/insertion_sort.py)

algorithms/sort/__init__.py

@@ -4,6 +4,7 @@
 from .comb_sort import *
 from .counting_sort import *
 from .cycle_sort import *
+from .exchange_sort import *
 from .heap_sort import *
 from .insertion_sort import *
 from .merge_sort import *

algorithms/sort/exchange_sort.py

@@ -0,0 +1,11 @@
+def exchange_sort(arr):
+ """
+ Reference : https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
+ Complexity : O(n^2)
+ """
+ arr_len = len(arr)
+ for i in range(arr_len-1):
+ for j in range(i+1, arr_len):
+ if(arr[i] > arr[j]):
+ arr[i], arr[j] = arr[j], arr[i]
+ return arr

tests/test_sort.py

@@ -5,6 +5,7 @@
  comb_sort,
  counting_sort,
  cycle_sort,
+ exchange_sort,
  max_heap_sort, min_heap_sort,
  insertion_sort,
  merge_sort,
@@ -55,6 +56,9 @@ def test_counting_sort(self):
  def test_cycle_sort(self):
  self.assertTrue(is_sorted(cycle_sort([1, 3, 2, 5, 65, 23, 57, 1232])))
 
+ def test_exchange_sort(self):
+ self.assertTrue(is_sorted(exchange_sort([1, 3, 2, 5, 65, 23, 57, 1232])))
+ 
  def test_heap_sort(self):
  self.assertTrue(is_sorted(max_heap_sort([1, 3, 2, 5, 65, 23, 57, 1232])))