From 3782207b2c541d6fa5bdde092db1708852932da9 Mon Sep 17 00:00:00 2001 From: Austin Conlon Date: Mon, 12 Oct 2020 07:37:07 -0700 Subject: [PATCH] Unitalicize "log" in big O notation (#17) --- Guides/Partition.md | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/Guides/Partition.md b/Guides/Partition.md index 0b25b2dd..393700dd 100644 --- a/Guides/Partition.md +++ b/Guides/Partition.md @@ -74,13 +74,13 @@ extension Collection { ### Complexity The existing partition is an O(_n_) operations, where _n_ is the length of the -range to be partitioned, while the stable partition is O(_n log n_). Both +range to be partitioned, while the stable partition is O(_n_ log _n_). Both partitions have algorithms with improved performance for bidirectional collections, so it would be ideal for those to be customization points were they to eventually land in the standard library. `partitioningIndex(where:)` is a slight generalization of a binary search, and -is an O(_log n_) operation for random-access collections; O(_n_) otherwise. +is an O(log _n_) operation for random-access collections; O(_n_) otherwise. ### Comparison with other languages