Add files via upload

Author: skjha1

Sorting Technique/13 Countsort.c

@@ -0,0 +1,54 @@
+#include <stdio.h>
+#include<stdlib.h>
+int findMax(int A[], int n) // fxn for finding max from array A // so that we can create a count array of max size
+{
+	int max = -2147483647;
+	int i;
+	for (i = 0; i < n; i++)
+	{
+		if (A[i] > max)
+			max = A[i];
+	}
+	return max;
+}
+void CountSort(int A[], int n)
+{
+	int i, j, max, * C;
+
+	max = findMax(A, n); // find max element from array 
+	C = (int*)malloc(sizeof(int) * (max + 1)); // creatring count array of max size 
+
+	for (i = 0; i < max + 1; i++) // intialise all count array with zero
+	{ 
+		C[i] = 0;
+	}
+	for (i = 0; i < n; i++) // count the no of elements present and increment the count array index 
+	{
+		C[A[i]]++;
+	}
+
+	i = 0; j = 0;
+	while (j < max + 1) // copy all the elements back to A 
+	{
+		if (C[j] > 0)
+		{
+			A[i++] = j;
+			C[j]--;
+		}
+		else
+			j++;
+	}
+}
+int main()
+{
+	int A[] = { 11,13,7,12,16,9,24,5,10,3 }, n = 10, i;
+
+	CountSort(A, n);
+
+	for (i = 0; i < 10; i++)
+		printf("%d ", A[i]);
+	printf("\n");
+
+	return 0;
+}
+// time comlexity  O (n ) // less time taken // but it is space counsuming algorithm // when the value of elements will be less we will opt this algo

Sorting Technique/14 CountSortFunction.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+
+using namespace std;
+ 
+template <class T>
+void Print(T& vec, int n, string s){
+    cout << s << ": [" << flush;
+    for (int i=0; i<n; i++){
+        cout << vec[i] << flush;
+        if (i < n-1){
+            cout << ", " << flush;
+        }
+    }
+    cout << "]" << endl;
+}
+ 
+int Max(int A[], int n){
+    int max = -32768;
+    for (int i=0; i<n; i++){
+        if (A[i] > max){
+            max = A[i];
+        }
+    }
+    return max;
+}
+ 
+void CountSort(int A[], int n){
+    int max = Max(A, n);
+ 
+    // Create count array
+    int* count = new int [max + 1];
+ 
+    // Initialize count array with 0
+    for (int i=0; i<max+1; i++){
+        count[i] = 0;
+    }
+ 
+    // Update count array values based on A values
+    for (int i=0; i<n; i++){
+        count[A[i]]++;
+    }
+ 
+    // Update A with sorted elements
+    int i = 0;
+    int j = 0;
+    while (j < max+1){
+        if (count[j] > 0){
+            A[i++] = j;
+            count[j]--;
+        } else {
+            j++;
+        }
+    }
+ 
+    // Delete heap memory
+    delete [] count;
+}
+ 
+int main() {
+ 
+    int A[] = {2, 5, 8, 12, 3, 6, 7, 10};
+    int n = sizeof(A)/sizeof(A[0]);
+ 
+    Print(A, n, "\t\tA");
+    CountSort(A, n);
+    Print(A, n, " Sorted A");
+ 
+    return 0;
+}