Strand sort
id:
strand-sort-233-9458071
title:
Strand sort
text:
Strand sort is a recursive sorting algorithm that sorts items of a list into increasing order. It has O(n2) worst time complexity which occurs when the input list is reverse sorted. It has a best case time complexity of O(n) which occurs when the input is a list that is already sorted. The algorithm first moves the first element of a list into a sub-list. It then compares the last element in the sub-list to each subsequent element in the original list. Once there is an element in the original li
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Strand_sort
date created:
date modified:
2022-05-05T19:28:09Z
main entity:
{"identifier":"Q4808297","url":"https://www.wikidata.org/entity/Q4808297"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/d/de/StrandSort.gif","width":919,"height":391}
fields total:
13
integrity:
14