Wiggle sort changes (hacktoberfest Pull Request 2)

Author: TheQuantumn

sorts/wiggle_sort.py

@@ -1,18 +1,18 @@
 """
 Wiggle Sort.
 
-Given an unsorted array nums, reorder it such
-that nums[0] < nums[1] > nums[2] < nums[3]....
+Given an unsorted array nums, reorder it such that:
+nums[0] < nums[1] > nums[2] < nums[3]....
+
 For example:
 if input numbers = [3, 5, 2, 1, 6, 4]
-one possible Wiggle Sorted answer is [3, 5, 1, 6, 2, 4].
+One possible Wiggle Sorted answer is [3, 5, 1, 6, 2, 4].
 """
 
-
 def wiggle_sort(nums: list) -> list:
     """
-    Python implementation of wiggle.
-    Example:
+    Python implementation of Wiggle Sort.
+    
     >>> wiggle_sort([0, 5, 3, 2, 2])
     [0, 5, 2, 3, 2]
     >>> wiggle_sort([])
@@ -22,17 +22,18 @@ def wiggle_sort(nums: list) -> list:
     >>> wiggle_sort([-2.1, -5.68, -45.11])
     [-45.11, -2.1, -5.68]
     """
-    for i, _ in enumerate(nums):
+    for i in range(1, len(nums)):
         if (i % 2 == 1) == (nums[i - 1] > nums[i]):
             nums[i - 1], nums[i] = nums[i], nums[i - 1]
 
     return nums
 
 
 if __name__ == "__main__":
-    print("Enter the array elements:")
-    array = list(map(int, input().split()))
-    print("The unsorted array is:")
-    print(array)
-    print("Array after Wiggle sort:")
-    print(wiggle_sort(array))
+    try:
+        user_input = input("Enter the array elements (space-separated integers):\n").strip()
+        array = list(map(int, user_input.split()))
+        print("The unsorted array is:", array)
+        print("Array after Wiggle sort:", wiggle_sort(array))
+    except ValueError:
+        print("Error: Please enter valid integers.")