FilesExpand file tree

 v1

/

desc.json

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

13 lines (13 loc) · 683 Bytes

 v1

/

desc.json

Top

File metadata and controls

• Code
• Blame

13 lines (13 loc) · 683 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

{

"Selection Sort": "Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) time complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity, and it has performance advantages over more complicated algorithms in certain situations, particularly where auxiliary memory is limited.",

"Complexity": {

"time": "worst $O(n^2)$, best $O(n^2)$, average $O(n^2)$",

"space": "$O(1)$ auxiliary"

},

"References": [

"<a href='https://en.wikipedia.org/wiki/Selection_sort'>Wikipedia</a>"

],

"files": {

"basic": "Selection sort"

}

}