From b5aae35484404bd28142d5533d96f0799f0ef352 Mon Sep 17 00:00:00 2001 From: gerasimov Date: Tue, 20 Aug 2019 01:40:51 +0400 Subject: [PATCH] fix typo --- book/content/part02/queue.asc | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/book/content/part02/queue.asc b/book/content/part02/queue.asc index 626d7417..62d50ff2 100644 --- a/book/content/part02/queue.asc +++ b/book/content/part02/queue.asc @@ -77,7 +77,7 @@ As an experiment, we can see in the following table that if we had implemented t .2+.^s| Data Structure 2+^s| Searching By 3+^s| Inserting at the 3+^s| Deleting from .2+.^s| Space ^|_Index/Key_ ^|_Value_ ^|_beginning_ ^|_middle_ ^|_end_ ^|_beginning_ ^|_middle_ ^|_end_ | Queue (w/array) ^|- ^|- ^|- ^|- ^|O(1) ^|*O(n)* ^|- ^|- ^|O(n) -| Queue (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|- ^|- ^|O(1) ^|O(n) +| Queue (w/list) ^|- ^|- ^|- ^|- ^|O(1) ^|O(1) ^|- ^|- ^|O(n) |=== // end::table[] indexterm:[Runtime, Linear]