Revision as of 13:27, 30 November 2017 edit Njol (talk \| contribs) Extended confirmed users 677 edits m →Asymptotic amortized worst-case analysis: better name/link ← Previous edit		Revision as of 22:11, 10 February 2018 edit undo Klbrain (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers 97,904 edits Refining the merge template Next edit →
Line 1: {{Merge to\|Data structure\|date=May 2016\|discuss=Talk:Search data structure#"Search data structure"?}} In [[computer science]], a '''search data structure'''{{citation needed\|date=May 2016}} is any [[data structure]] that allows the efficient retrieval of specific items from a [[set (mathematics)\|set]] of items, such as a specific [[record (computer science)\|record]] from a [[database]].

Search data structure: Difference between revisions