Error: Protected edit requests can only be made on the talk page.
File:Empty | |
Class | Sorting algorithm |
---|---|
Data structure | Array |
Worst-case performance | not tested, so probally: |
Best-case performance | not tested, so probally: |
Average performance | probally: |
Worst-case space complexity | as it don't use auxiliary arrays [1] |
idk what here so other do fill it
Algorithm
editbasicly it works:
- take first value of array (called current) and go to array[current - 1] and switch places with other value same index as current, then continuing on first value do same repeatly
- if array[current - 1] is same as current - 1, it will go to 2nd value, and repeated until sorted
implementation/code
editwe will use python for this example
def Indexsort(arr):
current = 0
n = len(arr)
while current < n:
target = arr[current] - 1
if 0 <= target < n and arr[current] != arr[target]:
arr[current], arr[target] = arr[target], arr[current]
else:
current += 1
note
edit- current implementation likely crash if there repeated values
- needed gif image
- still under maintence, don't expect alot from it
- ^ Skiena (2008, p. 122)