From c6f0c589be31b9c39eb83b12721ae5dab4d4163b Mon Sep 17 00:00:00 2001 From: Ishani Date: Sat, 9 Mar 2019 13:02:27 +0530 Subject: [PATCH 1/2] Wiggle_sort --- sorts/Wiggle_Sort | 21 +++++++++++++++++++++ 1 file changed, 21 insertions(+) create mode 100644 sorts/Wiggle_Sort diff --git a/sorts/Wiggle_Sort b/sorts/Wiggle_Sort new file mode 100644 index 000000000000..cc83487bdeb1 --- /dev/null +++ b/sorts/Wiggle_Sort @@ -0,0 +1,21 @@ +""" +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]. +""" +def wiggle_sort(nums): + for i in range(len(nums)): + if (i % 2 == 1) == (nums[i-1] > nums[i]): + nums[i-1], nums[i] = nums[i], nums[i-1] + + +print("Enter the array elements:\n") +array=list(map(int,input().split())) +print("The unsorted array is:\n") +print(array) +wiggle_sort(array) +print("Array after Wiggle sort:\n") +print(array) + + From 4880ce7c6a098c284c2935e828972d49ed891a27 Mon Sep 17 00:00:00 2001 From: John Law Date: Mon, 18 Mar 2019 02:11:12 +0800 Subject: [PATCH 2/2] Rename Wiggle_Sort to wiggle_sort.py --- sorts/{Wiggle_Sort => wiggle_sort.py} | 0 1 file changed, 0 insertions(+), 0 deletions(-) rename sorts/{Wiggle_Sort => wiggle_sort.py} (100%) diff --git a/sorts/Wiggle_Sort b/sorts/wiggle_sort.py similarity index 100% rename from sorts/Wiggle_Sort rename to sorts/wiggle_sort.py