Update Cycle_Sort.py

Author: KavinduDr

Data Structures and Algorithms/Sorting Algorithms/Cycle_Sort.py

@@ -1,49 +1,50 @@
-def cycleSort(array):
-  writes = 0 # keeps track of the number of writes or swaps made during the sorting process
-   
-  # Loop through the array to find cycles to rotate.
-  for cycleStart in range(0, len(array) - 1):
-    item = array[cycleStart]
-     
-    # Find where to put the item.
-    position = cycleStart
-    for i in range(cycleStart + 1, len(array)):
-      if array[i] < item:
-        position += 1
-     
-    # If the item is already there, this is not a cycle.
-    if position == cycleStart:
-      continue
-     
-    # Otherwise, put the item there or right after any duplicates.
-    while item == array[position]:
-      position += 1
-    array[position], item = item, array[position]
-    writes += 1
-     
-    # Rotate the rest of the cycle.
-    while position != cycleStart:
-       
-      # Find where to put the item.
-      position = cycleStart
-      for i in range(cycleStart + 1, len(array)):
-        if array[i] < item:
-          position += 1
-       
-      # Put the item there or right after any duplicates.
-      while item == array[position]:
-        position += 1
-      array[position], item = item, array[position]
-      writes += 1
-   
-  return writes
-   
-   
-   
-arr = [1, 8, 3, 9, 10, 10, 2, 4 ]
-n = len(arr) 
-cycleSort(arr)
- 
-print("After sort : ")
-for i in range(0, n) : 
-    print(arr[i], end = ' ')
+from typing import List
+
+def cycle_sort(nums: List[int]) -> int:
+
+    writes = 0
+
+    for cycle_start in range(len(nums) - 1):
+        current = nums[cycle_start]
+
+        # Find the target position for the current item.
+        target_position = cycle_start
+        for i in range(cycle_start + 1, len(nums)):
+            if nums[i] < current:
+                target_position += 1
+
+        # Skip if the item is already in the correct position.
+        if target_position == cycle_start:
+            continue
+
+        # Handle duplicates by finding the next available position.
+        while current == nums[target_position]:
+            target_position += 1
+
+        nums[target_position], current = current, nums[target_position]
+        writes += 1
+
+        # Rotate the rest of the cycle.
+        while target_position != cycle_start:
+            target_position = cycle_start
+            for i in range(cycle_start + 1, len(nums)):
+                if nums[i] < current:
+                    target_position += 1
+
+            while current == nums[target_position]:
+                target_position += 1
+
+            nums[target_position], current = current, nums[target_position]
+            writes += 1
+
+    return writes
+
+
+if __name__ == "__main__":
+    arr = [1, 8, 3, 9, 10, 10, 2, 4]
+    print("Before sort:", arr)
+
+    writes = cycle_sort(arr)
+
+    print("After sort:", arr)
+    print(f"Number of writes: {writes}")