Code
Hub
Workspaces
Following
Trending
Connect
MCP
copy
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
""
"
2
Given an unsorted array nums, reorder it such that nums[0] < nums[1] > nums[2] < nums[3]....
3
For example:
4
if
input numbers = [3, 5, 2, 1, 6, 4]
Callers
nothing calls this directly
Calls
2
wiggle_sort
Function · 0.85
split
Method · 0.80
Tested by
no test coverage detected