skip to main | skip to sidebar

Data Structures Notes

Thursday, February 12, 2009

Time complexity - Omega of data structures

a) 2-4 tree - O(logn) [Omega logarithmic n]
Posted by Nash at 6:44 AM
Labels: data structures, Omega Time complexity

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Unique Visitors

Blog Archive

  • ▼  2009 (44)
    • ►  March (26)
    • ▼  February (18)
      • Binary tree traversal: Preorder, Inorder, and Post...
      • String Searching Algorithm - KMP Algorithm
      • Exercise-Radix Sorting
      • Exercise-Manipulating an element in an array (Repl...
      • Exercise-Reverse Polish Notation (RPN)
      • Sorting Algorithm - HeapSort & Heapify
      • Algorithm that returns the middle element of a dou...
      • Time complexity - Omega of data structures
      • Time complexity - Omega of algorithms
      • Checklist before selecting the right data structur...
      • Algorithm to print-all-pairs in the tables (X, Y)
      • Algorithm to Sum-up n number of items in the table
      • Time complexity of algorithms - In particular Big ...
      • Operation time complexity for a LINKED LIST
      • Operation time complexity for an ARRAY
      • Selection Sorting An Array
      • Bubble Sorting An Array
      • Computing The Median of An Array

About Me

Nash
View my complete profile