Skip to content

Commit c072b38

Browse files
AceCooooolAceCoooool
committed
update readme
1 parent 948dc0d commit c072b38

File tree

1 file changed

+18
-11
lines changed

1 file changed

+18
-11
lines changed

‎README.md

Lines changed: 18 additions & 11 deletions
Original file line numberDiff line numberDiff line change
@@ -13,7 +13,7 @@ Algorithms, 4th edition textbook code (using c++)
1313
1414
## ch1. Fundamentals
1515

16-
| REF | PROGRAM | DESCRIPTION / JAVADOC | REF | PROGRAM | DESCRIPTION / JAVADOC |
16+
| REF | PROGRAM | DESCRIPTION / C++DOC | REF | PROGRAM | DESCRIPTION / C++DOC |
1717
| :----------------------------------------------------------: | :-------------------------------------------------------: | :------------------------------: | :----------------------------------------------------------: | :---------------------------------------------------: | :-----------------------------: |
1818
| [-](https://algs4.cs.princeton.edu/11model/index.php#-) | [BinarySearch.h](ch1/head/BinarySearch.h) | binary search | [-](https://algs4.cs.princeton.edu/11model/index.php#-) | [RandomSeq.cpp](ch1/2_RandomSeq/main.cpp) | random numbers in a given range |
1919
| [-](https://algs4.cs.princeton.edu/11model/index.php#-) | [Average.cpp](ch1/3_Average/main.cpp) | average of a sequence of numbers | [-](https://algs4.cs.princeton.edu/11model/index.php#-) | [Cat.cpp](ch1/4_Cat/main.cpp) | concatenate files |
@@ -36,7 +36,7 @@ Algorithms, 4th edition textbook code (using c++)
3636

3737
## ch2. Sorting
3838

39-
| REF | PROGRAM | DESCRIPTION / JAVADOC | REF | PROGRAM | DESCRIPTION / JAVADOC |
39+
| REF | PROGRAM | DESCRIPTION / C++DOC | REF | PROGRAM | DESCRIPTION /C++DOC |
4040
| :----------------------------------------------------------: | :----------------------------------------------------------: | :-------------------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :---------------------------: |
4141
| [2.1](https://algs4.cs.princeton.edu/21elementary/index.php#2.1) | [Insertion.h](ch2/head/Insertion.h) | insertion sort | [-](https://algs4.cs.princeton.edu/21elementary/index.php#-) | [InsertionX.h](ch2/head/InsertionX.h) | insertion sort (optimized) |
4242
| [-](https://algs4.cs.princeton.edu/21elementary/index.php#-) | [BinaryInsertion.h](ch2/head/InsertionX.h) | binary insertion sort | [2.2](https://algs4.cs.princeton.edu/21elementary/index.php#2.2) | [Selection.h](ch2/head/InsertionX.h) | selection sort |
@@ -51,7 +51,7 @@ Algorithms, 4th edition textbook code (using c++)
5151

5252
## ch3. Searching
5353

54-
| REF | PROGRAM | DESCRIPTION / JAVADOC | REF | PROGRAM | DESCRIPTION / JAVADOC |
54+
| REF | PROGRAM | DESCRIPTION / C++DOC | REF | PROGRAM | DESCRIPTION /C++DOC |
5555
| :----------------------------------------------------------: | :-----------------------------------------------------: | :-----------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :--------------------------: |
5656
| [-](https://algs4.cs.princeton.edu/31elementary/index.php#-) | [FrequencyCounter.cpp](ch3/1_FrequencyCounter/main.cpp) | frequency counter | [3.1](https://algs4.cs.princeton.edu/31elementary/index.php#3.1) | [SequentialSearchST.h](ch3/head/SequentialSearchST.h) | sequential search |
5757
| [3.2](https://algs4.cs.princeton.edu/31elementary/index.php#3.2) | [BinarySearchST.h](ch3/head/BinarySearchST.h) | binary search | [3.3](https://algs4.cs.princeton.edu/32bst/index.php#3.3) | [BST.h](ch3/head/BST.h) | binary search tree |
@@ -64,12 +64,19 @@ Algorithms, 4th edition textbook code (using c++)
6464

6565
## ch4. Graphs
6666

67-
| REF | PROGRAM | DESCRIPTION / JAVADOC | REF | PROGRAM | DESCRIPTION / JAVADOC |
68-
| :---------------------------------------------------------: | :-----------------------------------------------: | :-----------------------------: | :---------------------------------------------------------: | :----------------------------------------------------------: | :---------------------------: |
69-
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Graph.h](ch4/head/Graph.h) | undirected graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [GraphGenerator.java](https://algs4.cs.princeton.edu/41graph/GraphGenerator.java.html) | generate random graphs |
70-
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [DepthFirstSearch.h](ch4/head/DepthFirstSearch.h) | depth-first search in a graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [NonrecursiveDFS.h](ch4/head/NonrecursiveDFS.h) | DFS in a graph (nonrecursive) |
71-
| [4.1](https://algs4.cs.princeton.edu/41graph/index.php#4.1) | [DepthFirstPaths.h](ch4/head/DepthFirstPaths.h) | paths in a graph (DFS) | [4.2](https://algs4.cs.princeton.edu/41graph/index.php#4.2) | [BreadthFirstPaths.h](ch4/head/BreadthFirstPaths.h) | paths in a graph (BFS) |
72-
| [4.3](https://algs4.cs.princeton.edu/41graph/index.php#4.3) | [CC.h](ch4/head/CC.h) | connected components of a graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Bipartite.h](ch4/head/Bipartite.h) | bipartite or odd cycle (DFS) |
73-
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [BipartiteX.h](ch4/head/BipartiteX.h) | bipartite or odd cycle (BFS) | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Cycle.h](ch4/head/Cycle.h) | cycle in a graph |
74-
| | | | | | |
67+
| REF | PROGRAM | DESCRIPTION / C++DOC | REF | PROGRAM | DESCRIPTION / C++DOC |
68+
| :----------------------------------------------------------: | :----------------------------------------------------------: | :-----------------------------: | :----------------------------------------------------------: | :----------------------------------------------------------: | :-------------------------------: |
69+
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Graph.h](ch4/head/Graph.h) | undirected graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [GraphGenerator.java](https://algs4.cs.princeton.edu/41graph/GraphGenerator.java.html) | generate random graphs |
70+
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [DepthFirstSearch.h](ch4/head/DepthFirstSearch.h) | depth-first search in a graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [NonrecursiveDFS.h](ch4/head/NonrecursiveDFS.h) | DFS in a graph (nonrecursive) |
71+
| [4.1](https://algs4.cs.princeton.edu/41graph/index.php#4.1) | [DepthFirstPaths.h](ch4/head/DepthFirstPaths.h) | paths in a graph (DFS) | [4.2](https://algs4.cs.princeton.edu/41graph/index.php#4.2) | [BreadthFirstPaths.h](ch4/head/BreadthFirstPaths.h) | paths in a graph (BFS) |
72+
| [4.3](https://algs4.cs.princeton.edu/41graph/index.php#4.3) | [CC.h](ch4/head/CC.h) | connected components of a graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Bipartite.h](ch4/head/Bipartite.h) | bipartite or odd cycle (DFS) |
73+
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [BipartiteX.h](ch4/head/BipartiteX.h) | bipartite or odd cycle (BFS) | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [Cycle.h](ch4/head/Cycle.h) | cycle in a graph |
74+
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [EulerianCycle.h](ch4/head/EulerianCycle.h) | Eulerian cycle in a graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [EulerianPath.h](ch4/head/EulerianPath.h) | Eulerian path in a graph |
75+
| [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [SymbolGraph.h](ch4/head/SymbolGraph.h) | symbol graph | [-](https://algs4.cs.princeton.edu/41graph/index.php#-) | [DegreesOfSeparation.cpp](ch4/14_DegreesOfSeparation/main.cpp) | degrees of separation |
76+
| [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [Digraph.h](ch4/head/Digraph.h) | directed graph | [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DigraphGenerator.h](ch4/head/DigraphGenerator.h) | generate random digraphs |
77+
| [4.4](https://algs4.cs.princeton.edu/42digraph/index.php#4.4) | [DirectedDFS.h](ch4/head/DirectedDFS.h) | depth-first search in a digraph | [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [NonrecursiveDirectedDFS.h](ch4/head/NonrecursiveDirectedDFS.h) | DFS in a digraph (nonrecursive) |
78+
| [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DepthFirstDirectedPaths.h](ch4/head/DepthFirstDirectedPaths.h) | paths in a digraph (DFS) | [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [BreadthFirstDirectedPaths.h](ch4/head/BreadthFirstDirectedPaths.h) | paths in a digraph (BFS) |
79+
| [-](https://algs4.cs.princeton.edu/44sp/index.php#-) | [DirectedCycle.h](ch4/head/DirectedCycle.h) | cycle in a digraph | [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DirectedCycleX.h](ch4/head/DirectedCycleX.h) | cycle in a digraph (nonrecursive) |
80+
| [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DirectedEulerianCycle.h](ch4/head/DirectedEulerianCycle.h) | Eulerian cycle in a digraph | [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DirectedEulerianPath.h](ch4/head/DirectedEulerianPath.h) | Eulerian path in a digraph |
81+
| [-](https://algs4.cs.princeton.edu/42digraph/index.php#-) | [DepthFirstOrder.h](ch4/head/DepthFirstOrder.h) | depth-first order in a digraph | [4.5](https://algs4.cs.princeton.edu/42digraph/index.php#4.5) | [Topological.h](ch4/head/Topological.h) | topological order in a DAG |
7582

0 commit comments

Comments
 (0)