クイックソート
1. quicksort (sorting algorithm)Computing
2. QuicksortQuicksort is a sorting algorithm developed by Tony Hoare that, on average, makes comparisons to sort n items. In the worst case, it makes comparisons, though this behavior is rare. Quicksort is often faster in practice than other algorithms. Additionally, quicksort's sequential and localized memory references work well with a cache. Quicksort can be implemented with an in-place partitioning algorithm, so the entire sort can be done with only additional space.
Read “Quicksort” on English Wikipedia
Read “クイックソート” on Japanese Wikipedia
Read “Quicksort” on DBpedia
Read “Quicksort” on English Wikipedia
Read “クイックソート” on Japanese Wikipedia
Read “Quicksort” on DBpedia
Discussions
Log in to talk about this word.