Added radixSort.cpp

Author: 5arthak01

sortingAlgo/countingSort/countingSort.cpp

@@ -1,25 +1,29 @@
 #include<iostream>
-#include<algorithm>
 #include<vector>
+#include<functional>
 
 using namespace std;
 
 #define ll long long
 
-vector<ll> counting_sort(vector<ll> v, ll k)
+vector<ll> counting_sort(vector<ll> v, function<ll(ll)> key = [](ll x){return x;},ll k=-1)
 {
 	vector<ll> w;
 	w.reserve(v.size());
 
-	vector<int> table(k+10, 0);
+	if(k==-1){
+		for(auto i : v)
+		if(k<i)k=i;
+	}
+
+	vector<vector<ll>> table(k+10); //vector<type_of_unsorted_vector>
 
 	for(auto i : v)
-		table[i]++;
+		table[key(i)].push_back(i);
 
 	for(ll i=0; i<=k+5; i++)
-		if(table[i])
-			while(table[i]--)
-				w.push_back(i);
+		for(auto j : table[i])
+			w.push_back(j);
 
 	return w;
 }
@@ -30,8 +34,12 @@ int main()
 
 	for(auto i : v)
 		cout<<i<<" ";
+	  
+	//user defined key for descending order  
+	function<ll(ll)> key;
+	key = [](ll x) {return 11-x;};
 
-	v=counting_sort(v, 11);
+	v=counting_sort(v, key);
 
 	cout<<"\n Sorted:\n";
 	for(auto i : v)
@@ -40,3 +48,29 @@ int main()
 
 	return 0;
 }
+
+
+/*
+vector<ll> counting_sort(vector<ll> v, ll k)
+{
+	vector<ll> w;
+	w.reserve(v.size());
+
+	if(k==-1){
+		for(auto i : v)
+		if(k<i)k=i;
+	}
+
+	vector<int> table(k+10, 0);
+
+	for(auto i : v)
+		table[i]++;
+
+	for(ll i=0; i<=k+5; i++)
+		if(table[i])
+			while(table[i]--)
+				w.push_back(i);
+
+	return w;
+}
+*/

sortingAlgo/countingSort/countingSort.py

@@ -1,7 +1,10 @@
 #TC
 arr = [10, 7, 8, 1, 4, 2, 5]
 
-def countingSort(arr, k, key=(lambda x:x)):
+def countingSort(arr, key=(lambda x:x), k=-1):
+    if k==-1:
+        k=max(arr)
+        
     table = [[] for _ in range(k+3)]
 
     for n in arr:

sortingAlgo/radixSort/radixSort.cpp

@@ -0,0 +1,83 @@
+#include<iostream>
+#include<vector>
+#include<functional>
+
+using namespace std;
+
+#define ll long long
+
+ll power(ll x, ll y)//fast integer exponentiation
+{
+	ll ans=1;
+	while(y)
+	{
+		if(y&1)
+			ans*=x;
+		y/=2;
+		x*=x;
+	}
+
+	return ans;
+}
+
+vector<ll> counting_sort(vector<ll> v, function<ll(ll)> key = [](ll x){return x;}, ll k=-1)
+{
+	vector<ll> w;
+	w.reserve(v.size());
+
+	if(k==-1){
+		for(auto i : v)
+			if(k<i)k=i;
+	}
+
+	vector<vector<ll>> table(k+10); //vector<type_of_unsorted_vector>
+
+	for(auto i : v)
+		table[key(i)].push_back(i);
+
+	for(ll i=0; i<=k+5; i++)
+		for(auto j : table[i])
+			w.push_back(j);
+
+	return w;
+}
+
+vector<ll> radix_sort(vector<ll> v, ll k=-1)
+{
+	if(k==-1){
+		for(auto i : v)
+			if(k<i)k=i;
+	}
+
+	ll b=v.size(); //base for radixsort is size of array
+
+	// MSB 'd' in maximum element 'k' in base b
+	ll d=0, temp=k;
+	while(temp/=b)
+		d++;
+
+	for(int i=0;i<=d;i++){
+		function<ll(ll)> key;
+		key = [i,b](ll x){return ((x/power(b,i))%b);};
+		v=counting_sort(v, key, k);
+	}
+
+	return v;
+}
+
+int main()
+{
+	vector<ll> v = {10, 9, 4, 5, 7};
+
+	for(auto i : v)
+		cout<<i<<" ";
+
+	v=radix_sort(v);
+
+	cout<<"\n Sorted:\n";
+	for(auto i : v)
+		cout<<i<<" ";
+	cout<<endl;
+
+	return 0;
+}

sortingAlgo/radixSort/radixSort.py

@@ -1,7 +1,10 @@
 #TC
 arr = [10, 7, 8, 1, 4, 2, 5]
 
-def countingSort(arr, k, key=(lambda x:x)):
+def countingSort(arr, k=-1, key=(lambda x:x)):
+    if k==-1:
+        k = max(arr)
+         
     table = [[] for _ in range(k+3)]
 
     for n in arr:
@@ -12,9 +15,12 @@ def countingSort(arr, k, key=(lambda x:x)):
         arr.extend(i)
     return arr
 
-def radixSort(arr, k):
+def radixSort(arr, k=-1):
     b = len(arr) # base for radix sort
-    
+
+    if k==-1:
+        k = max(arr)
+
     #calculate number of digits in k when in base b
     d = 0
     copy = k
@@ -27,4 +33,5 @@ def radixSort(arr, k):
 
     return arr
 
-print(radixSort(arr, 15))
+    
+print(radixSort(arr))