Skip to content

Commit 3a78468

Browse files
4ndrelim4ndrelim
committed
docs: Add details to profile and main README
1 parent cdc531d commit 3a78468

File tree

2 files changed

+32
-26
lines changed

2 files changed

+32
-26
lines changed

‎README.md‎

Lines changed: 23 additions & 17 deletions
Original file line numberDiff line numberDiff line change
@@ -26,24 +26,26 @@ Gradle is used for development.
2626
- [Linked List](src/main/java/dataStructures/linkedList)
2727
- LRU Cache
2828
- Minimum Spanning Tree
29+
* Kruskal
30+
* Prim's
31+
* Boruvska
2932
- [Queue](src/main/java/dataStructures/queue)
3033
- [Deque](src/main/java/dataStructures/queue/Deque)
3134
- [Monotonic Queue](src/main/java/dataStructures/queue/monotonicQueue)
3235
- Segment Tree
33-
* Array implementation
34-
* TreeNode implementation
3536
- [Stack](src/main/java/dataStructures/stack)
3637
- Trie
3738

3839
## Algorithms
40+
- [Bubble Sort](src/main/java/algorithms/sorting/bubbleSort)
41+
- [Binary Search](src/main/java/algorithms/binarySearch)
42+
* [Template](src/main/java/algorithms/binarySearch/binarySearchTemplated)
3943
- [Counting Sort](src/main/java/algorithms/sorting/countingSort)
4044
- [Cyclic Sort](src/main/java/algorithms/sorting/cyclicSort)
4145
* [Special case](src/main/java/algorithms/sorting/cyclicSort/simple) of O(n) time complexity
4246
* [Generalized case](src/main/java/algorithms/sorting/cyclicSort/generalised) of O(n^2) time complexity
43-
- [Knuth-Morris-Pratt](src/main/java/algorithms/patternFinding) aka KMP algorithm
44-
- [Bubble Sort](src/main/java/algorithms/sorting/bubbleSort)
4547
- [Insertion Sort](src/main/java/algorithms/sorting/insertionSort)
46-
- [Selection Sort](src/main/java/algorithms/sorting/selectionSort)
48+
- [Knuth-Morris-Pratt](src/main/java/algorithms/patternFinding) aka KMP algorithm
4749
- Merge Sort
4850
* [Recursive](src/main/java/algorithms/sorting/mergeSort/recursive)
4951
* [Bottom-up iterative](src/main/java/algorithms/sorting/mergeSort/iterative)
@@ -52,41 +54,45 @@ Gradle is used for development.
5254
* [Lomuto's](src/main/java/algorithms/sorting/quickSort/lomuto)
5355
* [Paranoid](src/main/java/algorithms/sorting/quickSort/paranoid)
5456
* [3-way Partitioning](src/main/java/algorithms/sorting/quickSort/threeWayPartitioning)
55-
- [Radix Sort](src/main/java/algorithms/sorting/radixSort/)
57+
- [Radix Sort](src/main/java/algorithms/sorting/radixSort)
58+
- [Selection Sort](src/main/java/algorithms/sorting/selectionSort)
5659

57-
## Short-cut to CS2040S Material
60+
## CS2040S Syllabus (in rough order)
5861
1. Basic structures
5962
* [Linked List](src/main/java/dataStructures/linkedList)
6063
* [Stack](src/main/java/dataStructures/stack)
6164
* [Queue](src/main/java/dataStructures/queue)
6265
2. [Binary Search](src/main/java/algorithms/binarySearch)
6366
* Peak Finding
64-
* Simple Version
65-
* Universal Version
67+
* [Template](src/main/java/algorithms/binarySearch/binarySearchTemplated)
6668
3. Sorting
6769
* [Bubble](src/main/java/algorithms/sorting/bubbleSort)
6870
* [Insertion](src/main/java/algorithms/sorting/insertionSort)
6971
* [Selection](src/main/java/algorithms/sorting/selectionSort)
7072
* [Merge](src/main/java/algorithms/sorting/mergeSort)
7173
* [Quick](src/main/java/algorithms/sorting/quickSort)
74+
* [Hoare's](src/main/java/algorithms/sorting/quickSort/hoares)
75+
* [Lomuto's](src/main/java/algorithms/sorting/quickSort/lomuto) (Not discussed in CS2040s)
76+
* [Paranoid](src/main/java/algorithms/sorting/quickSort/paranoid)
77+
* [3-way Partitioning](src/main/java/algorithms/sorting/quickSort/threeWayPartitioning)
78+
* [Counting Sort](src/main/java/algorithms/sorting/countingSort) (found in tutorial)
79+
* [Radix Sort](src/main/java/algorithms/sorting/radixSort) (found in tutorial)
7280
4. Trees
7381
* [Binary search tree](src/main/java/dataStructures/binarySearchTree)
7482
* AVL-tree
83+
* Orthogonal Range Searching
84+
* Trie
85+
* B-Tree
86+
* * Red-Black Tree (Not covered in CS2040s but useful!)
7587
* Kd-tree (**WIP**)
7688
* Interval tree (**WIP**)
77-
* Augmented tree for orthogonal range searching
78-
* Red-Black Tree
79-
* ab-Tree
80-
5. [Binary Heap](src/main/java/dataStructures/heap)
81-
* Max heap implementation
89+
5. [Binary Heap](src/main/java/dataStructures/heap) (Max heap)
8290
6. [Disjoint Set / Union Find](src/main/java/dataStructures/disjointSet)
8391
* [Quick Find](src/main/java/dataStructures/disjointSet/quickFind)
84-
* [Weighted Union](src/main/java/dataStructures/disjointSet/weightedUnion)
85-
* Path compression
92+
* [Weighted Union](src/main/java/dataStructures/disjointSet/weightedUnion) (with path compression)
8693
7. [Hashing](src/main/java/dataStructures/hashSet)
8794
* [Chaining](src/main/java/dataStructures/hashSet/chaining)
8895
* [Open Addressing](src/main/java/dataStructures/hashSet/openAddressing)
89-
* Double Hashing
9096
* Bloom filter (**WIP**)
9197
8. Basic graphs (**WIP**)
9298
* Depth-first search

‎docs/team/profiles.md‎

Lines changed: 9 additions & 9 deletions
Original file line numberDiff line numberDiff line change
@@ -1,11 +1,11 @@
11
# Team Profile
22

3-
| Name | Description/About | Website (LinkedIn/GitHub/Personal) | Contributions |
4-
|-----------|--------------------------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------|--------------------------------------------------------------------------------|
5-
| Andre | An aspiring ML engineer. My stint as a CS2040s TA has convinced several capable and passionate students to join me in developing this project :) | You can find me [here](https://4ndrelim.github.io) as well! | Team lead |
6-
| Kai ting | ... | ... | Trees and Sorts! All sorts!<br/>Bubble, Insertion, Selection, Merge, Quick |
7-
| Changxian | ... | ... | Tricky Hashing and its variants |
8-
| Owen | ... | ... | Graphs and confusing mazes |
9-
| Shu Heng | Interested in ML, aspiring researcher. | No website but here's my [Linkedin](https://www.linkedin.com/in/yeoshuheng), please give me a job :< | Fundamentals! Linked List and its variants, Stacks & Queues and their variants |
10-
| Junneng | Aspiring tech entrepreneur. | [LinkedIn](https://www.linkedin.com/in/soo-jun-neng/) | Trees and Binary Search variants |
11-
| Amadeus | ... | ... | Graphs! Dijkstra .. |
3+
| Name | Description/About | Website (LinkedIn/GitHub/Personal) | Contributions |
4+
|-----------|----------------------------------------------------------------------------------------------------------------------------------|------------------------------------------------------------------------------------------------------|-------------------------------------------------------------|
5+
| Andre | Aspiring ML engineer. My stint as a CS2040s TA has convinced several capable and passionate students to develop this together :) | You can find me [here](https://4ndrelim.github.io)! | Team lead |
6+
| Kai ting | ... | ... | Cool sorting and obscure trees! B-Trees, ORS.. |
7+
| Changxian | ... | ... | Hashing variants! BTS DevOps - configure Gradle & workflows |
8+
| Shu Heng | Interested in ML, aspiring researcher. | No website but here's my [Linkedin](https://www.linkedin.com/in/yeoshuheng), please give me a job :< | CS Fundamentals! Stacks and queues! RB-tree. |
9+
| Junneng | Aspiring tech entrepreneur. | [LinkedIn](https://www.linkedin.com/in/soo-jun-neng/) | Binary Search variants, Minimum Spanning Trees! |
10+
| Amadeus | ... | ... | Graphs! |
11+
| Owen | ... | ... | Graphs and confusing mazes |

0 commit comments

Comments
 (0)