We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent f484075 commit 288ff77Copy full SHA for 288ff77
book/content/part04/sorting-algorithms.asc
@@ -135,8 +135,7 @@ We explored many algorithms some of them simple and other more performant. Also,
135
| <<part04-algorithmic-toolbox#insertion-sort>> | O(n^2^) | O(n) | O(n^2^) | O(1) | Yes | Yes | Yes | Yes
136
| <<part04-algorithmic-toolbox#selection-sort>> | O(n^2^) | O(n^2^) | O(n^2^) | O(1) | No | Yes | No | No
137
| <<part04-algorithmic-toolbox#merge-sort>> | O(n log n) | O(n log n) | O(n log n) | O(n) | Yes | No | No | No
138
-| <<part04-algorithmic-toolbox#quicksort>> | O(n log n) | O(n^2^) | O(n log n) | O(log n) | Yes | Yes | No | No
+| <<part04-algorithmic-toolbox#quicksort>> | O(n log n) | O(n log n) | O(n^2^) | O(log n) | No | Yes | No | No
139
// | Tim sort | O(n log n) | O(log n) | Yes | No | No | Yes
140
|===
141
// end::table[]
142
-
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments