From f1535a29127af24065f162245a8b04d93bd8afdf Mon Sep 17 00:00:00 2001 From: Tait Hoyem Date: Wed, 13 Apr 2022 11:24:08 -0600 Subject: [PATCH 1/2] Use thead --- Tables.html | 13 ++++++++----- 1 file changed, 8 insertions(+), 5 deletions(-) diff --git a/Tables.html b/Tables.html index 2322456..a175ff2 100644 --- a/Tables.html +++ b/Tables.html @@ -1,6 +1,6 @@

Common Data Structure Operations

- + @@ -24,7 +24,8 @@

Common Data Structure Operations

- + + @@ -193,11 +194,12 @@

Common Data Structure Operations

- +
Data Structure Time Complexity Deletion
Array Θ(1) O(n) O(n)

Array Sorting Algorithms

+ @@ -210,7 +212,8 @@

Array Sorting Algorithms

- + + @@ -302,5 +305,5 @@

Array Sorting Algorithms

- +
Algorithm Time Complexity Worst Worst
Quicksort Ω(n log(n)) O(n log(n)) O(n)
From 8621c52dd99dd7a188ceef405fe096c9c968fed8 Mon Sep 17 00:00:00 2001 From: Tait Hoyem Date: Wed, 13 Apr 2022 11:29:29 -0600 Subject: [PATCH 2/2] Add row headers --- Tables.html | 54 ++++++++++++++++++++++++++--------------------------- 1 file changed, 27 insertions(+), 27 deletions(-) diff --git a/Tables.html b/Tables.html index a175ff2..daf0ae9 100644 --- a/Tables.html +++ b/Tables.html @@ -27,7 +27,7 @@

Common Data Structure Operations

- Array + Array Θ(1) Θ(n) Θ(n) @@ -39,7 +39,7 @@

Common Data Structure Operations

O(n) - Stack + Stack Θ(n) Θ(n) Θ(1) @@ -51,7 +51,7 @@

Common Data Structure Operations

O(n) - Queue + Queue Θ(n) Θ(n) Θ(1) @@ -63,7 +63,7 @@

Common Data Structure Operations

O(n) - Singly-Linked List + Singly-Linked List Θ(n) Θ(n) Θ(1) @@ -75,7 +75,7 @@

Common Data Structure Operations

O(n) - Doubly-Linked List + Doubly-Linked List Θ(n) Θ(n) Θ(1) @@ -87,7 +87,7 @@

Common Data Structure Operations

O(n) - Skip List + Skip List Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -99,7 +99,7 @@

Common Data Structure Operations

O(n log(n)) - Hash Table + Hash Table N/A Θ(1) Θ(1) @@ -111,7 +111,7 @@

Common Data Structure Operations

O(n) - Binary Search Tree + Binary Search Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -123,7 +123,7 @@

Common Data Structure Operations

O(n) - Cartesian Tree + Cartesian Tree N/A Θ(log(n)) Θ(log(n)) @@ -135,7 +135,7 @@

Common Data Structure Operations

O(n) - B-Tree + B-Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -147,7 +147,7 @@

Common Data Structure Operations

O(n) - Red-Black Tree + Red-Black Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -159,7 +159,7 @@

Common Data Structure Operations

O(n) - Splay Tree + Splay Tree N/A Θ(log(n)) Θ(log(n)) @@ -171,7 +171,7 @@

Common Data Structure Operations

O(n) - AVL Tree + AVL Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -183,7 +183,7 @@

Common Data Structure Operations

O(n) - KD Tree + KD Tree Θ(log(n)) Θ(log(n)) Θ(log(n)) @@ -215,91 +215,91 @@

Array Sorting Algorithms

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