You can edit almost every page by Creating an account. Otherwise, see the FAQ.

Big o list

From EverybodyWiki Bios & Wiki

This is a list of average and worst case runtime for data structures.

Data Structure Average Worst Case
Space Search Insert Delete Space Search Insert Delete
k-d tree O(n) O(logn) O(logn) O(logn) O(n) O(n) O(n) O(n)
Association List O(n) O(n) O(1) O(n) O(n) O(n) O(1) O(n)
Skip List O(n) O(log(n)) O(log(n)) O(log(n)) O(n log(n)) O(n) O(n) O(n)
Queue O(n) O(n) O(1) O(1) O(n) O(n) O(1) O(1)

This article "Big o list" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Big o list. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.