Skip to content

Commit 804f50b

Browse files
trekhlebtrekhleb
committed
Add quick sort.
1 parent dfdd1ac commit 804f50b

1 file changed

Lines changed: 12 additions & 22 deletions

File tree

‎README.md‎

Lines changed: 12 additions & 22 deletions
Original file line numberDiff line numberDiff line change
@@ -89,29 +89,19 @@ Below is the list of some of the most used Big O notations and their performance
8989
| **O(2^N)** | 1024 | 1.26e+29 | 1.07e+301 |
9090
| **O(N!)** | 3628800 | 9.3e+157 | 4.02e+2567 |
9191

92-
### Common Data Structure Operations Complexity
93-
94-
<table>
95-
<tr>
96-
<td>One</td>
97-
<td>Two</td>
98-
</tr>
99-
<tr>
100-
<td colspan="2">Three</td>
101-
</tr>
102-
</table>
103-
104-
| Data Structure | Access | Search | Insertion | Deletion |
92+
### Data Structure Operations Complexity
93+
94+
| Data Structure | Access | Search | Insertion | Deletion |
10595
| ----------------------- | :-------: | :-------: | :-------: | :-------: |
106-
| **Array** | 1 | n | n | n |
107-
| **Stack** | n | n | 1 | 1 |
108-
| **Queue** | n | n | 1 | 1 |
109-
| **Linked List** | n | n | 1 | 1 |
110-
| **Hash Table** | | n | n | n |
111-
| **Binary Search Tree** | n | n | n | n |
112-
| **B-Tree** | log(n) | log(n) | log(n) | log(n) |
113-
| **Red-Black Tree** | log(n) | log(n) | log(n) | log(n) |
114-
| **AVL Tree** | log(n) | log(n) | log(n) | log(n) |
96+
| **Array** | 1 | n | n | n |
97+
| **Stack** | n | n | 1 | 1 |
98+
| **Queue** | n | n | 1 | 1 |
99+
| **Linked List** | n | n | 1 | 1 |
100+
| **Hash Table** | - | n | n | n |
101+
| **Binary Search Tree** | n | n | n | n |
102+
| **B-Tree** | log(n) | log(n) | log(n) | log(n) |
103+
| **Red-Black Tree** | log(n) | log(n) | log(n) | log(n) |
104+
| **AVL Tree** | log(n) | log(n) | log(n) | log(n) |
115105

116106
### Array Sorting Algorithms Complexity
117107

0 commit comments

Comments
 (0)