MCPcopy Create free account
hub / github.com/subbarayudu-j/TheAlgorithms-Python / wiggle_sort.py

File wiggle_sort.py

sorts/wiggle_sort.py:None–None  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

1"""
2Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
3For example:
4if input numbers = [3, 5, 2, 1, 6, 4]

Callers

nothing calls this directly

Calls 2

wiggle_sortFunction · 0.85
splitMethod · 0.80

Tested by

no test coverage detected