Search data structure: Difference between revisions

Revision as of 22:16, 14 February 2010

Revision as of 22:17, 14 February 2010

Line 25:

====Asymptotic worst-case analysis====

In this table, the [[big-O notation|notation O(''f''(''n''))]] means "not exceeding some fixed multiple of ''f''(''n'')" in the worst case".

{| class="wikitable"

Line 50:

| O(''n'')

|-

| Sorted Arrayarray

| O(''n'')

| O(''n'')

Line 57:

| O(''n'')

|-

| Unsorted [[Linkedlinked list]]

| O(1)

| O(1)