diff --git a/Tables.html b/Tables.html index 2322456..5e1504f 100644 --- a/Tables.html +++ b/Tables.html @@ -31,11 +31,11 @@

Common Data Structure Operations

Θ(n) Θ(n) Θ(n) - O(1) - O(n) - O(n) - O(n) - O(n) + Θ(1) + Θ(n) + Θ(n) + Θ(n) + Θ(n) Stack @@ -43,11 +43,11 @@

Common Data Structure Operations

Θ(n) Θ(1) Θ(1) - O(n) - O(n) - O(1) - O(1) - O(n) + Θ(n) + Θ(n) + Θ(1) + Θ(1) + Θ(n) Queue @@ -55,11 +55,11 @@

Common Data Structure Operations

Θ(n) Θ(1) Θ(1) - O(n) - O(n) - O(1) - O(1) - O(n) + Θ(n) + Θ(n) + Θ(1) + Θ(1) + Θ(n) Singly-Linked List @@ -67,11 +67,11 @@

Common Data Structure Operations

Θ(n) Θ(1) Θ(1) - O(n) - O(n) - O(1) - O(1) - O(n) + Θ(n) + Θ(n) + Θ(1) + Θ(1) + Θ(n) Doubly-Linked List @@ -79,11 +79,11 @@

Common Data Structure Operations

Θ(n) Θ(1) Θ(1) - O(n) - O(n) - O(1) - O(1) - O(n) + Θ(n) + Θ(n) + Θ(1) + Θ(1) + Θ(n) Skip List @@ -91,11 +91,11 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(n) - O(n) - O(n) - O(n) - O(n log(n)) + Θ(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n log(n)) Hash Table @@ -104,10 +104,10 @@

Common Data Structure Operations

Θ(1) Θ(1) N/A - O(n) - O(n) - O(n) - O(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) Binary Search Tree @@ -115,11 +115,11 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(n) - O(n) - O(n) - O(n) - O(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) Cartesian Tree @@ -128,22 +128,22 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) N/A - O(n) - O(n) - O(n) - O(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) B-Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(n) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(n) Red-Black Tree @@ -151,11 +151,11 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(n) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(n) Splay Tree @@ -164,10 +164,10 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) N/A - O(log(n)) - O(log(n)) - O(log(n)) - O(n) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(n) AVL Tree @@ -175,11 +175,11 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(log(n)) - O(n) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(log(n)) + Θ(n) KD Tree @@ -187,11 +187,11 @@

Common Data Structure Operations

Θ(log(n)) Θ(log(n)) Θ(log(n)) - O(n) - O(n) - O(n) - O(n) - O(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) + Θ(n) @@ -213,94 +213,94 @@

Array Sorting Algorithms

Quicksort - Ω(n log(n)) Θ(n log(n)) - O(n^2) - O(log(n)) + Θ(n log(n)) + Θ(n^2) + Θ(log(n)) Mergesort - Ω(n log(n)) Θ(n log(n)) - O(n log(n)) - O(n) + Θ(n log(n)) + Θ(n log(n)) + Θ(n) Timsort - Ω(n) + Θ(n) + Θ(n log(n)) Θ(n log(n)) - O(n log(n)) - O(n) + Θ(n) Heapsort - Ω(n log(n)) Θ(n log(n)) - O(n log(n)) - O(1) + Θ(n log(n)) + Θ(n log(n)) + Θ(1) Bubble Sort - Ω(n) + Θ(n) Θ(n^2) - O(n^2) - O(1) + Θ(n^2) + Θ(1) Insertion Sort - Ω(n) + Θ(n) + Θ(n^2) Θ(n^2) - O(n^2) - O(1) + Θ(1) Selection Sort - Ω(n^2) Θ(n^2) - O(n^2) - O(1) + Θ(n^2) + Θ(n^2) + Θ(1) Tree Sort - Ω(n log(n)) Θ(n log(n)) - O(n^2) - O(n) + Θ(n log(n)) + Θ(n^2) + Θ(n) Shell Sort - Ω(n log(n)) + Θ(n log(n)) + Θ(n(log(n))^2) Θ(n(log(n))^2) - O(n(log(n))^2) - O(1) + Θ(1) Bucket Sort - Ω(n+k) Θ(n+k) - O(n^2) - O(n) + Θ(n+k) + Θ(n^2) + Θ(n) Radix Sort - Ω(nk) Θ(nk) - O(nk) - O(n+k) + Θ(nk) + Θ(nk) + Θ(n+k) Counting Sort - Ω(n+k) Θ(n+k) - O(n+k) - O(k) + Θ(n+k) + Θ(n+k) + Θ(k) Cubesort - Ω(n) + Θ(n) + Θ(n log(n)) Θ(n log(n)) - O(n log(n)) - O(n) + Θ(n)