Skip to content

Commit 6bfd4c6

Browse files
rain1024rain1024
authored
GH-135: Big-O in C++ (#198)
1 parent c2bfecd commit 6bfd4c6

File tree

2 files changed

+30
-116
lines changed

2 files changed

+30
-116
lines changed

‎readme/cpp/README.md

Lines changed: 30 additions & 115 deletions
Original file line numberDiff line numberDiff line change
@@ -1,58 +1,15 @@
11
<!-- BEGIN HEADER -->
2-
<h1 align="center">
2+
<h2 align="center">
33
Data Structures & Algorithms <br/>
4-
Competitive Programming
5-
</h1>
4+
Competitive Programming <br/>
5+
<i>in C++</i>
6+
</h2>
67
<!-- END HEADER -->
78

89
This repository contains introductions and examples of many popular data structures and algorithms.
910

1011
Each data structures and algorithm has its own separate article with related explanations and links for further reading (including ones to YouTube videos).
1112

12-
---
13-
14-
<h4 align="center">
15-
Programming Languages: <br/>
16-
<a href="/readme/python">Python</a>,
17-
<a href="/readme/cpp">C++</a>,
18-
<a href="/readme/java">Java</a>,
19-
<a href="/readme/javascript">Javascript</a>,
20-
<a href="/readme/nodejs">NodeJS</a>,
21-
<a href="/readme/typescript">Typescript</a>,
22-
<a href="/readme/csharp">C#</a>,
23-
<a href="/readme/php">PHP</a>,
24-
<a href="/readme/c">C</a>,
25-
<a href="/readme/go">Go</a>,
26-
<a href="/readme/kotlin">Kotlin</a>,
27-
<a href="/readme/rust">Rust</a>,
28-
<a href="/readme/ruby">Ruby</a>
29-
</h4>
30-
31-
---
32-
33-
⭐ [New Version 1.2.0 is released.](https://github.com/rain1024/datastructures-algorithms-competitive-programming/releases)
34-
35-
## ⚛ Introduction
36-
37-
<!-- Section: Introduction -->
38-
<ul>
39-
<li>
40-
Introduction to Data Structures and Algorithms
41-
</li>
42-
<li>
43-
Introduction to Competitive Programming
44-
</li>
45-
<li>
46-
Introduction to Programming Languages
47-
</li>
48-
<li>
49-
<a href="/concepts/abstract/big-o.md">Big-O</a>
50-
<a href="/concepts/cpp/big-o.md"><code>cpp🐀</code></a>
51-
<a href="/concepts/python/big-o.md"><code>py🐍</code></a>
52-
<a href="/concepts/typescript/big-o.md"><code>ts</code></a>
53-
</li>
54-
</ul>
55-
5613
## 📑 Data Structures
5714

5815
A data structure is a data organization, management, and storage format that is usually chosen for efficient access to data. More recisely, a data structure is a collection of data values, the relationships among them, and the functions or operations that can be applied to the data.
@@ -61,52 +18,40 @@ A data structure is a data organization, management, and storage format that is
6118

6219
<ul>
6320
<li>
64-
<code>B</code> Array
65-
<a href="/concepts/python/array.md"><code>py🐍</code></a>
66-
<a href="/concepts/typescript/array.md"><code>ts</code></a>
21+
<code>B</code>
22+
<a href="/concepts/python/array.md">Array</a>
6723
</li>
6824
<li>
6925
<code>B</code> String
70-
<a href="/concepts/python/string.md"><code>py🐍</code></a>
7126
</li>
7227
<li>
7328
<code>B</code> Linked List
74-
<a href="/concepts/python/linked-list.md"><code>py🐍</code></a>
75-
<a href="/concepts/typescript/linked-list.md"><code>ts</code></a>
7629
</li>
7730
<li>
7831
<code>B</code> Stack
79-
<a href="/concepts/python/stack.md"><code>py🐍</code></a>
80-
<a href="/concepts/typescript/stack.md"><code>ts</code></a>
8132
</li>
8233
<li>
83-
<code>B</code> Queue
84-
<a href="/concepts/cpp/queue.md"><code>cpp🐀</code></a>
85-
<a href="/concepts/python/queue.md"><code>py🐍</code></a>
86-
<a href="/concepts/typescript/queue.md"><code>ts</code></a>
34+
<code>B</code>
35+
<a href="/concepts/cpp/queue.md">Queue</a>
8736
</li>
8837
<li>
89-
<code>B</code> Set
90-
<a href="/concepts/cpp/set.md"><code>cpp🐀</code></a>
91-
<a href="/concepts/python/sets.md"><code>py🐍</code></a>
92-
<a href="/concepts/typescript/set.md"><code>ts</code></a>
38+
<code>B</code>
39+
<a href="/concepts/cpp/set.md">Set</a>
9340
</li>
9441
<li>
95-
<code>B</code> Hash Table
96-
<a href="/concepts/cpp/hash_table.md"><code>cpp🐀</code></a>
97-
<a href="/concepts/python/hash_table.md"><code>py🐍</code></a>
42+
<code>B</code>
43+
<a href="/concepts/cpp/hash_table.md">Hash Table</a>
9844
</li>
9945
<li>
10046
<code>B</code> Heap
10147
</li>
10248
<li>
103-
<code>B</code> Priority Queue
104-
<a href="/concepts/cpp/priority_queue.md"><code>cpp🐀</code></a>
49+
<code>B</code>
50+
<a href="/concepts/cpp/priority_queue.md">Priority Queue</a>
10551
</li>
10652
<li>
107-
<code>A</code> Tree
108-
<a href="/concepts/cpp/tree.md"><code>cpp🐀</code></a>
109-
<a href="/concepts/python/tree.md"><code>py🐍</code></a>
53+
<code>A</code>
54+
<a href="/concepts/cpp/tree.md">Tree</a>
11055
<ul>
11156
<li><code>A</code> Binary Search Tree</li>
11257
<li><code>A</code> AVL Tree</li>
@@ -119,9 +64,8 @@ A data structure is a data organization, management, and storage format that is
11964
<code>A</code> Graph
12065
</li>
12166
<li>
122-
<code>A</code> Prefix sum (Range queries)
123-
<a href="/concepts/cpp/range_queries.md"><code>cpp🐀</code></a>
124-
<a href="/concepts/python/range_queries.md"><code>py🐍</code></a>
67+
<code>A</code>
68+
<a href="/concepts/cpp/range_queries.md">Prefix sum (Range queries)</a>
12569
</li>
12670
<li>
12771
<code>A</code> Disjoin Set
@@ -133,8 +77,8 @@ A data structure is a data organization, management, and storage format that is
13377
<code>A</code> LRU Cache
13478
</li>
13579
<li>
136-
<code>A</code> Skiplist
137-
<a href="/concepts/cpp/skip_list.md"><code>cpp🐀</code>
80+
<code>A</code>
81+
<a href="/concepts/cpp/skip_list.md">Skiplist</a>
13882
</li>
13983
</ul>
14084

@@ -149,12 +93,14 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
14993
<ul>
15094
<!-- ======== Begin Math ======== -->
15195
<li>
96+
<b><a href="/concepts/cpp/big-o.md">Big-O</a></b>
97+
</li>
98+
<li>
15299
<b>Math</b>
153100
<ul>
154101
<li>
155-
<code>B</code> Bit Manipulation
156-
<a href="/concepts/cpp/bitwise.md"><code>cpp🐀</code></a>
157-
<a href="/concepts/python/bitwise.md"><code>py🐍</code></a>
102+
<code>B</code>
103+
<a href="/concepts/cpp/bitwise.md">Bit Manipulation</a>
158104
</li>
159105
<li>
160106
<code>B</code> Binary Floating Point
@@ -292,7 +238,6 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
292238
<!-- ======== Begin Searches ======== -->
293239
<li>
294240
<b>Searches</b>
295-
<a href="/concepts/python/searching.md"><code>py🐍</code></a>
296241
<ul>
297242
<li>
298243
<code>B</code> Linear Search
@@ -311,9 +256,7 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
311256
<!-- ======== End Searches ======== -->
312257
<!-- ======== Begin Sorting ======== -->
313258
<li>
314-
<b>Sorting</b>
315-
<a href="/concepts/cpp/sorting.md"><code>cpp🐀</code></a>
316-
<a href="/concepts/python/sorting.md"><code>py🐍</code></a>
259+
<b><a href="/concepts/cpp/sorting.md">Sorting</a></b>
317260
<ul>
318261
<li>
319262
<code>B</code> Bubble Sort
@@ -529,9 +472,7 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
529472
<ul>
530473
<!-- ======== Begin Brute Force ======== -->
531474
<li>
532-
<b>Brute Force</b> - look at all the possibilities and selects the best solution
533-
<a href="/concepts/cpp/brute_force.md"><code>cpp🐀</code></a>
534-
<a href="/concepts/python/brute_force.md"><code>py🐍</code></a>
475+
<b><a href="/concepts/cpp/brute_force.md">Brute Force</a></b> - look at all the possibilities and selects the best solution
535476
<ul>
536477
<li>
537478
<code>B</code> Linear Search
@@ -556,8 +497,7 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
556497
<!-- ======== End Brute Force ======== -->
557498
<!-- ======== Begin Greedy ======== -->
558499
<li>
559-
<b>Greedy</b> - make the locally optimal choice at each stage with the hope of finding a global optimum
560-
<a href="/concepts/python/greedy.md"><code>py🐍</code></a>
500+
<b><a href="/concepts/python/greedy.md">Greedy</a></b> - make the locally optimal choice at each stage with the hope of finding a global optimum
561501
<ul>
562502
<li>
563503
<code>B</code> Jump Game
@@ -631,8 +571,7 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
631571
<!-- ======== End Divide and Conquer ======== -->
632572
<!-- ======== Begin Dynamic Programming ======== -->
633573
<li>
634-
<b>Dynamic Programming</b> - break the problem into subproblems and store the results of subproblems to avoid computing the same results again
635-
(basic: <a href="/concepts/cpp/dp_basic.md"><code>cpp🐀</code></a>, intermidate: <a href="/concepts/cpp/dp_intermediate.md"><code>cpp🐀</code></a>)
574+
<b><a href="/concepts/cpp/dp_basic.md">Dynamic Programming</a></b> - break the problem into subproblems and store the results of subproblems to avoid computing the same results again
636575
<ul>
637576
<li>
638577
<code>B</code> Fibonacci Number
@@ -721,28 +660,4 @@ An algorithm is a finite sequence of rigorous instructions, typically used to so
721660
<b>Branch & Bound</b> remember the lowest-cost solution found at each stage of the backtracking search, and use the cost of the lowest-cost solution found so far as a lower bound on the cost of a least-cost solution to the problem, in order to discard partial solutions with costs larger than the lowest-cost solution found so far. Normally BFS traversal in combination with DFS traversal of state-space tree is being used.
722661
</li>
723662
<!-- ======== End Branch & Bound ======== -->
724-
</ul>
725-
726-
## 🔆 Collections
727-
728-
**Competitive Programming Events**
729-
730-
* 🎄 Advent of Code ([2022](collections/advent-of-code-2022/))
731-
* 🔰 Google Code Jam ([2022](collections/codejam-2022/))
732-
733-
**Coding Problems Website**
734-
735-
* [🔸 LeetCode](collections/leetcode/)
736-
737-
**Courses & Specialization**
738-
739-
* [🍨 Data Structures and Algorithms Specialization](collections/datastructures-and-algorithms-specialization/), University of California San Diego
740-
741-
## Contributors
742-
743-
This project exists thanks to all the people who contributed.
744-
745-
<a href="https://github.com/rain1024/datastructures-algorithms-competitive-programming/graphs/contributors">
746-
<img src="https://contrib.rocks/image?repo=rain1024/datastructures-algorithms-competitive-programming" />
747-
</a>
748-
663+
</ul>

‎readme/python/README.md

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -4,7 +4,6 @@ Data Structures & Algorithms <br/>
44
Competitive Programming <br/>
55
<i>in Python</i>
66
</h2>
7-
87
<!-- END HEADER -->
98

109
This repository contains introductions and examples of many popular data structures and algorithms.

0 commit comments

Comments
 (0)