mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-31 06:33:44 +00:00
Code Issues Packages Projects Releases Wiki Activity

added wiggle_sort.py (#734)

Browse Source 
* Wiggle_sort

* Rename Wiggle_Sort to wiggle_sort.py
This commit is contained in:
Ishani 2019-03-17 23:42:22 +05:30 committed by John Law
parent 8e67ac3b76
commit 96c36f8286
1 changed files with 21 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

21
sorts/wiggle_sort.py Normal file
View File

@ -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)