sorting/counting.py

-Original file line number
+Diff line change
@@ -0,0 +1,19 @@
+    """Python implementation of in-place counting sort algorithm"""
+    def countingsort(array, maxval):
+    	n = len(array)
+    	m = maxval + 1
+        # init with zeros
+    	count = [0] * m
+    	for a in array:
+    	# count occurences
+    		count[a] += 1
+    	i = 0
+    	for a in range(m):
+    	# make 'count[a]' copies of 'a'
+    		for c in range(count[a]):
+    			array[i] = a
+    			i += 1
+    	return array

tests.py

-Original file line number
+Diff line change
@@ Expand Up / @@ -55,3 +55,13 @@ @@
             print "Bucket Sort incorrect"
     except:
         print "Bucketsort function errored or is incomplete"
+    try:
+    	from counting import countingsort
+    	if(countingsort(list(nums), numpy.max(nums)) == sortedNums):
+    		print "Counting Sort success!"
+    	else:
+    		print "Counting Sort incorrect."
+    except:
+    	print "Countingsort function errored or is incomplete."

Added implementation of in-place counting sort along with tests #89

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open

hriaz17 wants to merge 3 commits into programmingprincess:master from hriaz17:countingsort-implementation

-Original file line number
+Diff line change
@@ -0,0 +1,19 @@
+    """Python implementation of in-place counting sort algorithm"""
+    def countingsort(array, maxval):
+    	n = len(array)
+    	m = maxval + 1
+        # init with zeros
+    	count = [0] * m
+    	for a in array:
+    	# count occurences
+    		count[a] += 1
+    	i = 0
+    	for a in range(m):
+    	# make 'count[a]' copies of 'a'
+    		for c in range(count[a]):
+    			array[i] = a
+    			i += 1
+    	return array

-Original file line number
+Diff line change
@@ Expand Up / @@ -55,3 +55,13 @@ @@
             print "Bucket Sort incorrect"
     except:
         print "Bucketsort function errored or is incomplete"
+    try:
+    	from counting import countingsort
+    	if(countingsort(list(nums), numpy.max(nums)) == sortedNums):
+    		print "Counting Sort success!"
+    	else:
+    		print "Counting Sort incorrect."
+    except:
+    	print "Countingsort function errored or is incomplete."

Provide feedback