Search data structure: Revision history

7 October 2015

• curprev 17:2817:28, 7 October 2015 77.97.242.143 talk 6,844 bytes +2,500 Add citation for unsorted array insert and delete, fix linked list delete times with citation (delete and search are considered as independent operations in the classic texts and should not be conflated). Fix sorted linked list maximum as O(1). undo

24 May 2015

• curprev 05:2805:28, 24 May 2015 Davidair talk contribs 4,344 bytes +44 Constant-time deletes are wrong for linked lists, inserts are logN for BSTs and Heap, other incorrect timings undo

12 July 2014

• curprev 21:2321:23, 12 July 2014 Dalton Quinn talk contribs m 4,300 bytes +5 →Asymptotic amortized worst-case analysis undo

4 July 2014

• curprev 22:4422:44, 4 July 2014 Magioladitis talk contribs m 4,295 bytes −10 closed unbalanced tags using AWB (10274) undo

23 June 2014

• curprev 23:4823:48, 23 June 2014 Dalton Quinn talk contribs 4,305 bytes 0 →Asymptotic amortized worst-case analysis undo
• curprev 23:4723:47, 23 June 2014 Dalton Quinn talk contribs 4,305 bytes +51 →Asymptotic amortized worst-case analysis: Trees don't always require balancing, so making this O(1), added Tries to the list. undo
• curprev 12:5612:56, 23 June 2014 Dalton Quinn talk contribs 4,254 bytes −283 Added balancing speed to the table to distinguish between data structures that would otherwise appear similar. undo

5 October 2013

• curprev 18:4318:43, 5 October 2013 50.131.53.129 talk 4,537 bytes −18 →Asymptotic amortized worst-case analysis undo
• curprev 18:3218:32, 5 October 2013 50.131.53.129 talk 4,555 bytes +8 →Asymptotic amortized worst-case analysis undo
• curprev 18:3018:30, 5 October 2013 50.131.53.129 talk 4,547 bytes −32 →Asymptotic amortized worst-case analysis undo

30 July 2013

• curprev 02:4302:43, 30 July 2013 96.50.85.29 talk 4,579 bytes +16 Inserting into a sorted linked list is O(log n) because you can search for the index using a binary-search. undo Tag: Visual edit

1 July 2013

• curprev 12:1412:14, 1 July 2013 Kathovo talk contribs m 4,563 bytes −4 Reverted edits by 142.245.59.16 (talk) to last revision by 128.187.97.18 (HG) undo
• curprev 12:1312:13, 1 July 2013 142.245.59.16 talk 4,567 bytes +4 →Footnotes undo

8 June 2012

• curprev 00:4000:40, 8 June 2012 128.187.97.18 talk 4,563 bytes 0 →Asymptotic amortized worst-case analysis undo

30 May 2012

• curprev 02:2502:25, 30 May 2012 68.173.113.106 talk 4,563 bytes +32 +Unreferenced undo

21 September 2011

• curprev 03:3303:33, 21 September 2011 Headbomb talk contribs m 4,531 bytes −47 Cleanup for Book:Data structures, removed stub tag using AWB (7840) undo

28 June 2011

• curprev 21:3121:31, 28 June 2011 Scandum talk contribs 4,578 bytes +3 →Asymptotic amortized worst-case analysis undo

16 March 2011

• curprev 14:3514:35, 16 March 2011 18.244.3.177 talk 4,575 bytes −1 →Asymptotic amortized worst-case analysis: Fixed a typo (extra quotation mark, period outside quotation). undo

16 February 2011

• curprev 04:4104:41, 16 February 2011 Woodshed talk contribs 4,576 bytes +22 Disambiguated: queries → Information retrieval undo

11 October 2010

• curprev 00:1100:11, 11 October 2010 199.33.32.40 talk 4,554 bytes +33 →Asymptotic worst-case analysis undo
• curprev 00:0600:06, 11 October 2010 199.33.32.40 talk 4,521 bytes +71 →Asymptotic worst-case analysis undo

25 September 2010

• curprev 13:4313:43, 25 September 2010 X7q talk contribs 4,450 bytes −50 Undid revision 386788026 by 217.219.222.67 (talk) wrong undo

24 September 2010

• curprev 18:1718:17, 24 September 2010 217.219.222.67 talk 4,500 bytes +50 No edit summary undo

24 May 2010

• curprev 04:5404:54, 24 May 2010 143.44.78.159 talk 4,450 bytes +6 →Asymptotic worst-case analysis: Adjustments for formatting undo
• curprev 04:5304:53, 24 May 2010 143.44.78.159 talk 4,444 bytes +246 →Asymptotic worst-case analysis: Updated Linked Lists to reflect proper time cost undo

24 March 2010

• curprev 11:0011:00, 24 March 2010 Hosamaly talk contribs m 4,198 bytes 0 Fixed a typing mistake (changed "ietms" into "items") undo

14 February 2010

• curprev 22:2422:24, 14 February 2010 Jorge Stolfi talk contribs m 4,198 bytes +186 →Asymptotic worst-case analysis: Table footnote, undo
• curprev 22:1722:17, 14 February 2010 Jorge Stolfi talk contribs m 4,012 bytes +1 →Asymptotic worst-case analysis: typos undo
• curprev 22:1622:16, 14 February 2010 Jorge Stolfi talk contribs m 4,011 bytes +8 →Asymptotic worst-case analysis: markup fix undo
• curprev 22:1522:15, 14 February 2010 Jorge Stolfi talk contribs 4,003 bytes −304 →Asymptotic worst-case analysis: (1) unlink repeated links, per WP custom; (2) separate unsorted array from value-indexed one; (3) delete for unsorted array is O(1) undo

13 February 2010

• curprev 15:4715:47, 13 February 2010 Andreas Kaufmann talk contribs m 4,307 bytes −2 →See also undo

14 January 2010

• curprev 12:3712:37, 14 January 2010 Devendermishra talk contribs 4,309 bytes +403 →Asymptotic worst-case analysis: adding few links undo
• curprev 03:1103:11, 14 January 2010 118.210.204.239 talk 3,906 bytes 0 No edit summary undo

12 January 2010

• curprev 19:3419:34, 12 January 2010 Clayhalliwell talk contribs m 3,906 bytes +7 fixed redlink undo

3 January 2010

• curprev 04:0204:02, 3 January 2010 GTBacchus talk contribs m 3,899 bytes +14 stub sorting undo

2 January 2010

• curprev 18:1618:16, 2 January 2010 Jorge Stolfi talk contribs 3,885 bytes +16 →Single ordered keys: +hash undo
• curprev 18:1518:15, 2 January 2010 Jorge Stolfi talk contribs m 3,869 bytes +3 →Classification: fix link undo
• curprev 18:1518:15, 2 January 2010 Jorge Stolfi talk contribs m 3,866 bytes +9 →See also: marked as stub undo
• curprev 18:1518:15, 2 January 2010 Jorge Stolfi talk contribs 3,857 bytes +2,667 Started stub with old contents "comparison of data structures" undo
• curprev 17:1917:19, 2 January 2010 Jorge Stolfi talk contribs m 1,190 bytes 0 moved Search data structures to Search data structure: Oops, name must be singular by Wikipedia rules undo
• curprev 17:1817:18, 2 January 2010 Jorge Stolfi talk contribs m 1,190 bytes 0 moved Comparison of data structures to Search data structures: (1) The comparison given is only among (basic) search data structures. (2) A aomparison of *all* data structures makes no sense. (3) There is no article on "search data structures" an undo

17 November 2009

• curprev 13:4813:48, 17 November 2009 86.144.48.118 talk 1,190 bytes +63 →correct search and maximum for array and hash table entries with caveat undo
• curprev 13:2913:29, 17 November 2009 86.144.48.118 talk 1,127 bytes +192 →add ref to search on array if indexed directly by computed raw data value undo

7 November 2009

• curprev 16:2616:26, 7 November 2009 62.1.143.76 talk 935 bytes +104 m link additions to help decode the information for non techies like myself undo

24 October 2009

• curprev 18:4318:43, 24 October 2009 Quibik talk contribs m 831 bytes −2 →Footnotes: convert to {{reflist}} undo

16 October 2009

• curprev 20:2120:21, 16 October 2009 Trigger hurt talk contribs 833 bytes 0 incorrect time for sorted linked list undo

28 September 2009

• curprev 22:5422:54, 28 September 2009 76.120.96.146 talk 833 bytes 0 No edit summary undo

23 August 2009

• curprev 01:3901:39, 23 August 2009 X7q talk contribs 833 bytes +69 a few corrections undo

19 August 2009

• curprev 14:4614:46, 19 August 2009 Vicarious talk contribs 764 bytes +4 correction, on delete heaps have to shift entries up. undo

17 August 2009

• curprev 19:0619:06, 17 August 2009 Vicarious talk contribs 760 bytes +760 Creating page with some of the basics, could certainly use expansion.