puruagarwal1 · RawHit02 · Oct 8, 2023 · Oct 8, 2023
diff --git a/add-timer-decorator.py → Add-Timer-Decorator.py b/add-timer-decorator.py → Add-Timer-Decorator.py
diff --git a/binarySearch.py → BinarySearch.py b/binarySearch.py → BinarySearch.py
diff --git a/breadth_first_search.py → Breadth_First_Search.py b/breadth_first_search.py → Breadth_First_Search.py
diff --git a/cheat sheet.py → Cheat_Sheet.py b/cheat sheet.py → Cheat_Sheet.py
diff --git a/checkLeapYear.py → CheckLeapYear.py b/checkLeapYear.py → CheckLeapYear.py
diff --git a/chess.py → Chess.py b/chess.py → Chess.py
diff --git a/Dijkstra's algorithm.py → Dijkstra's_Algorithm.py b/Dijkstra's algorithm.py → Dijkstra's_Algorithm.py
diff --git a/euclideanAlgorithm.py → EuclideanAlgorithm.py b/euclideanAlgorithm.py → EuclideanAlgorithm.py
diff --git a/even.py → Even.py b/even.py → Even.py
diff --git a/Face-Attendance-System/main.py → Face-Attendance-System/Main.py b/Face-Attendance-System/main.py → Face-Attendance-System/Main.py
diff --git a/...ttendance-System/Resources/background.png → ...ttendance-System/Resources/Background.png b/...ttendance-System/Resources/background.png → ...ttendance-System/Resources/Background.png
diff --git a/factorial recurssion.py → Factorial_Recurssion.py b/factorial recurssion.py → Factorial_Recurssion.py
diff --git a/kadanesAlgorithm.py → KadanesAlgorithm.py b/kadanesAlgorithm.py → KadanesAlgorithm.py
diff --git a/Kotlin/binarySearch.kt → Kotlin/BinarySearch.kt b/Kotlin/binarySearch.kt → Kotlin/BinarySearch.kt
diff --git a/Kotlin/fibonacciSeries.kt → Kotlin/FibonacciSeries.kt b/Kotlin/fibonacciSeries.kt → Kotlin/FibonacciSeries.kt
diff --git a/Kotlin/insertionSort.kt → Kotlin/InsertionSort.kt b/Kotlin/insertionSort.kt → Kotlin/InsertionSort.kt
diff --git a/Kotlin/linearSearch.kt → Kotlin/LinearSearch.kt b/Kotlin/linearSearch.kt → Kotlin/LinearSearch.kt
diff --git a/Kotlin/selectionSort.kt → Kotlin/SelectionSort.kt b/Kotlin/selectionSort.kt → Kotlin/SelectionSort.kt
diff --git a/leetcode-groupAnagrams.py → Leetcode_GroupAnagrams.py b/leetcode-groupAnagrams.py → Leetcode_GroupAnagrams.py
diff --git a/linkedlist.py → LinkedlLst.py b/linkedlist.py → LinkedlLst.py
diff --git a/lowerBoundAndUpperBound.py → LowerBoundAndUpperBound.py b/lowerBoundAndUpperBound.py → LowerBoundAndUpperBound.py
diff --git a/merge_sort.py → Merge_Sort.py b/merge_sort.py → Merge_Sort.py
diff --git a/prt.py → Prt.py b/prt.py → Prt.py
diff --git a/Python/Graphs/bfs.py → Python/Graphs/Bfs.py b/Python/Graphs/bfs.py → Python/Graphs/Bfs.py
diff --git a/Python/Graphs/dfs.py → Python/Graphs/Dfs.py b/Python/Graphs/dfs.py → Python/Graphs/Dfs.py
diff --git a/pythonlearn.py → Pythonlearn.py b/pythonlearn.py → Pythonlearn.py
diff --git a/Radix_Sorting_Method b/Radix_Sorting_Method
@@ -0,0 +1,37 @@
+# Radix sort is a non-comparative sorting algorithm that works by distributing elements into buckets based on their individual digits. It's particularly useful for sorting integers. Here's a Python implementation of radix sort:
+
+
+def counting_sort(arr, exp):
+    n = len(arr)
+    output = [0] * n
+    count = [0] * 10
+
+    for i in range(n):
+        index = arr[i] // exp
+        count[index % 10] += 1
+
+    for i in range(1, 10):
+        count[i] += count[i - 1]
+
+    i = n - 1
+    while i >= 0:
+        index = arr[i] // exp
+        output[count[index % 10] - 1] = arr[i]
+        count[index % 10] -= 1
+        i -= 1
+
+    for i in range(n):
+        arr[i] = output[i]
+
+def radix_sort(arr):
+    max_element = max(arr)
+    exp = 1
+
+    while max_element // exp > 0:
+        counting_sort(arr, exp)
+        exp *= 10
+
+# Example usage
+arr = [170, 45, 75, 90, 802, 24, 2, 66]
+radix_sort(arr)
+print("Sorted array:", arr)
diff --git a/selection_sort.py → Selection_Sort.py b/selection_sort.py → Selection_Sort.py
diff --git a/sets → Sets b/sets → Sets