Merge pull request #100 from abheer18/main

added radix sort DS in java

COVID-Tracker-App_hemangdtu/android/.project

@@ -0,0 +1,28 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<projectDescription>
+	<name>android</name>
+	<comment>Project android created by Buildship.</comment>
+	<projects>
+	</projects>
+	<buildSpec>
+		<buildCommand>
+			<name>org.eclipse.buildship.core.gradleprojectbuilder</name>
+			<arguments>
+			</arguments>
+		</buildCommand>
+	</buildSpec>
+	<natures>
+		<nature>org.eclipse.buildship.core.gradleprojectnature</nature>
+	</natures>
+	<filteredResources>
+		<filter>
+			<id>1633949326835</id>
+			<name></name>
+			<type>30</type>
+			<matcher>
+				<id>org.eclipse.core.resources.regexFilterMatcher</id>
+				<arguments>node_modules|.git|__CREATED_BY_JAVA_LANGUAGE_SERVER__</arguments>
+			</matcher>
+		</filter>
+	</filteredResources>
+</projectDescription>

COVID-Tracker-App_hemangdtu/android/.settings/org.eclipse.buildship.core.prefs

@@ -0,0 +1,13 @@
+arguments=
+auto.sync=false
+build.scans.enabled=false
+connection.gradle.distribution=GRADLE_DISTRIBUTION(VERSION(7.0-rc-1))
+connection.project.dir=
+eclipse.preferences.version=1
+gradle.user.home=
+java.home=C\:/Users/Lenovo/AppData/Local/Programs/AdoptOpenJDK/jdk-11.0.11.9-hotspot
+jvm.arguments=
+offline.mode=false
+override.workspace.settings=true
+show.console.view=true
+show.executions.view=true

RadixSort.java

@@ -0,0 +1,77 @@
+// Radix sort Java implementation
+import java.io.*;
+import java.util.*;
+
+class RadixSort {
+
+
+	static int getMax(int arr[], int n)
+	{
+		int mx = arr[0];
+		for (int i = 1; i < n; i++)
+			if (arr[i] > mx)
+				mx = arr[i];
+		return mx;
+	}
+
+	static void countSort(int arr[], int n, int exp)
+	{
+		int output[] = new int[n]; // output array
+		int i;
+		int count[] = new int[10];
+		Arrays.fill(count, 0);
+
+		// Store count of occurrences in count[]
+		for (i = 0; i < n; i++)
+			count[(arr[i] / exp) % 10]++;
+
+		// Change count[i] so that count[i] now contains
+		// actual position of this digit in output[]
+		for (i = 1; i < 10; i++)
+			count[i] += count[i - 1];
+
+		// Build the output array
+		for (i = n - 1; i >= 0; i--) {
+			output[count[(arr[i] / exp) % 10] - 1] = arr[i];
+			count[(arr[i] / exp) % 10]--;
+		}
+
+		// Copy the output array to arr[], so that arr[] now
+		// contains sorted numbers according to current digit
+		for (i = 0; i < n; i++)
+			arr[i] = output[i];
+	}
+
+	// The main function to that sorts arr[] of size n using
+	// Radix Sort
+	static void radixsort(int arr[], int n)
+	{
+		// Find the maximum number to know number of digits
+		int m = getMax(arr, n);
+
+		// Do counting sort for every digit. Note that
+		// instead of passing digit number, exp is passed.
+		// exp is 10^i where i is current digit number
+		for (int exp = 1; m / exp > 0; exp *= 10)
+			countSort(arr, n, exp);
+	}
+
+	// A utility function to print an array
+	static void print(int arr[], int n)
+	{
+		for (int i = 0; i < n; i++)
+			System.out.print(arr[i] + " ");
+	}
+
+	/*Driver Code*/
+	public static void main(String[] args)
+	{
+		int arr[] = { 170, 45, 75, 90, 802, 24, 2, 66 };
+		int n = arr.length;
+
+		// Function Call
+		radixsort(arr, n);
+		print(arr, n);
+	}
+}
+