FilesExpand file tree

 Write-for-current-Python

/

wiggle_sort.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (32 loc) · 929 Bytes

 Write-for-current-Python

/

wiggle_sort.py

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (32 loc) · 929 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

"""

Wiggle Sort.

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: list) -> list:

"""

Python implementation of wiggle.

Example:

>>> wiggle_sort([0, 5, 3, 2, 2])

[0, 5, 2, 3, 2]

>>> wiggle_sort([])

[]

>>> wiggle_sort([-2, -5, -45])

[-45, -2, -5]

>>> wiggle_sort([-2.1, -5.68, -45.11])

[-45.11, -2.1, -5.68]

"""

for i, _ in enumerate(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))