Selection Sort (Comparison Sorting Sorting): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O( n² )$ == Space Complexity == $O({1})$ (in-situ) words (in-situ) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1962 == Reference == -")
 
No edit summary
 
Line 1: Line 1:
== Time Complexity ==  
== Time Complexity ==  


$O( )$
$O(n^{2})$


== Space Complexity ==  
== Space Complexity ==  

Latest revision as of 09:29, 10 April 2023

Time Complexity

$O(n^{2})$

Space Complexity

$O({1})$ (in-situ) words

(in-situ)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1962

Reference

-