skip to main
|
skip to sidebar
Data Structures Notes
Thursday, February 12, 2009
Algorithm that returns the middle element of a double linked list
FindTheMiddleElementofDoubleLinkedList(L)
01 i <- head
02 j <- tail
03 while i != j do
04 i <- i.next
05 j <- j.previous
06 return i
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
No comments:
Post a Comment