master

Commits

f961904
feat: complete some practice questions
mo khan
2020-10-11 20:32:29
585e674
docs: improve formatting for all questions
mo khan
2020-10-11 19:16:36
abf62fb
docs: improve question 1 formatting
mo khan
2020-10-11 19:12:20
b6173d1
docs: convert sample final exam from pdf to markdown
mo khan
2020-10-11 19:10:42
a71877e
Remove old getting started instructions
mo khan
2020-09-27 20:21:38
d7a7bb7
docs: Document input parameters for matrix_traverse function
tag: 3.0.0
mo khan
2020-09-27 19:17:17
44f9921
Add link to README
mo khan
2020-09-27 19:14:36
fc3968b
docs: document each function
mo khan
2020-09-27 19:11:12
1fdac31
docs: Add documentation for AVL tree
mo khan
2020-09-27 18:38:47
cf2dec1
style: run cclang formatter
mo khan
2020-09-27 02:10:19
4090ab7
chore: update fmt task to format one dir up
mo khan
2020-09-27 02:05:11
bd7fc9d
docs: small formatting updates
mo khan
2020-09-27 02:02:34
dd6410a
docs: add headings to assignment 3
mo khan
2020-09-27 01:58:57
5cb4ce5
Collapse all questions into a single README
mo khan
2020-09-27 01:44:29
c930208
Merge 02 -> README
mo khan
2020-09-27 01:42:02
bfcc2fa
01 -> README
mo khan
2020-09-27 01:41:17
36d01ed
feat: prove that height of binary tree is greater than or equal to log2(k) where k is the # of leaves in the tree
mo khan
2020-09-27 01:39:48
b1efa9c
feat: build a meldable heap
mo khan
2020-09-27 00:53:30
6b0b895
Split diagrams up
mo khan
2020-09-26 23:38:24
cbc2006
Extract adjacency matrix into separate files
mo khan
2020-09-26 23:33:30
e7fc8f9
feat: implement backtracking algorithm to visit each edge in both directions
mo khan
2020-09-26 23:05:39
ddbdfe5
feat: work on algorithm to find path that traverses each edges in both directions
mo khan
2020-09-26 22:42:52
ac4edb7
docs: provide visual representation of an adjacency matrix
mo khan
2020-09-26 20:09:55
dbb2eb1
docs: add visualization of traversing graph via bfs
mo khan
2020-09-26 19:32:03
0c74c26
docs: add visualization of dfs
mo khan
2020-09-26 19:15:39
3426758
Add some notes on how to implement a proof
mo khan
2020-09-26 18:44:40
2b73696
docs: add visual for each AVL rotation
mo khan
2020-09-21 01:33:31
937998e
docs: add source code from book as starting point to modify
mo khan
2020-09-21 01:21:51
35fe546
docs: add code that question is based on
mo khan
2020-09-21 01:15:02
a240eea
docs: print output of merge/quick sort
mo khan
2020-09-21 00:58:13
8678b27
refactor: make private function static
mo khan
2020-09-21 00:31:11
aaf96ed
docs: complete question 3
mo khan
2020-09-21 00:27:57
3f2c6ca
docs: update illustration for question 1
mo khan
2020-09-21 00:19:17
17b3e2b
refactor: rename colour() to change_colour()
mo khan
2020-09-21 00:13:47
5abec51
docs: updates steps to colour avl tree to rb tree
mo khan
2020-09-21 00:04:35
317ccdf
test: convert large avl tree to rb tree
mo khan
2020-09-20 23:57:35
57de152
refactor: change colouring algorithm
mo khan
2020-09-20 23:41:28
2a9f5f3
test: ensure rb node parents are equal
mo khan
2020-09-20 23:06:55
e1466ec
feat: print rb node parent in #inspect
mo khan
2020-09-20 22:58:16
383ee26
fix: assign rb tree parent when converting from avl tree
mo khan
2020-09-20 22:57:19
d166f33
test: add assertions to check rb tree validity
mo khan
2020-09-20 22:44:34
ef16af7
test: add test to ensure is valid returns true
mo khan
2020-09-20 22:41:17
2c238fc
test: ensure red-black fails when any criteria is invalid
mo khan
2020-09-20 22:39:37
262a7ad
test: add test to validate rb tree with red root
mo khan
2020-09-20 20:38:11
6d195cd
refactor: rename connected to has_edge
mo khan
2020-09-08 16:52:44
81f845f
test: add test to check if vertices are connected
mo khan
2020-09-08 00:55:03
373fbfd
refactor: inline variable declarations
mo khan
2020-09-08 00:51:54
007076e
feat: record edges in graph
mo khan
2020-09-08 00:49:24
642c56d
docs: add notes on binary trie
mo khan
2020-09-08 00:36:31
78f5d8b
docs: add notes on graphs
mo khan
2020-09-08 00:13:22
4d6aa98
Ensure that 128 vertices can be added to graph
mo khan
2020-09-07 21:38:18
c942a50
feat: add vertex to graph
mo khan
2020-09-07 21:20:53
8737272
feat: add function to init vertex
mo khan
2020-09-07 19:55:54
5aaa100
test: add graph_tests to suite
mo khan
2020-09-07 19:50:13
7565e1a
feat: implement quick sort
mo khan
2020-09-07 19:35:42
2ba679e
fix: correct off by one error in merge sort
mo khan
2020-09-07 18:58:41
fae9911
compare head of two lists to merge
mo khan
2020-09-07 01:12:23
20ccf96
Sort out some of the merge sort failures
mo khan
2020-09-06 22:04:03
f8e6343
Add merge sort tests
mo khan
2020-09-05 21:48:40
79e375f
test: start to work on sorting tests
mo khan
2020-08-31 20:59:23
5748e87
fix: root of red/black tree is black
mo khan
2020-09-02 23:57:45
08d689b
fix: colour red when node is odd with parent that has even height
mo khan
2020-09-02 23:51:16
8ffa9b4
docs: add notes on heap, counting, and radix sort
mo khan
2020-08-31 20:31:17
6a32a15
test: add a counter example to break algorithm
mo khan
2020-08-31 19:15:21
51e59d8
fix: handle repair with missing grandparent
mo khan
2020-08-31 19:09:49
16e6a20
docs: document algorithm to convert AVL to Red-Black tree
mo khan
2020-08-31 18:06:02
2e99c5f
refactor: delegate to convenience constructor
mo khan
2020-08-31 18:04:35
29cb2db
fix: assign colour based on height
mo khan
2020-08-31 17:56:48
02f04d0
fix: ensure equals checks for colour
mo khan
2020-08-31 17:35:13
00b9cfe
feat: add function to convert avl tree to rb tree
mo khan
2020-08-30 19:20:56
fb0f63d
feat: add rb_tree_equals function
mo khan
2020-08-30 19:18:27
1f952f1
refactor: extract convenience constructor
mo khan
2020-08-30 01:02:12
ab994a8
refactor: extract method to find root
mo khan
2020-08-30 00:56:19
4a9fb54
refactor: collapse some conditional logic
mo khan
2020-08-30 00:38:41
c898a2b
style: remove debug code
mo khan
2020-08-30 00:30:26
176006d
fix: repaint colour when unbalanced
mo khan
2020-08-30 00:28:19
3bfe570
test: Add to left/right subtree
mo khan
2020-08-29 20:08:16
fc294bf
feat: insert into red/black tree
mo khan
2020-08-29 19:29:48
2c5a1f4
create initializer for red/black tree
mo khan
2020-08-28 20:24:45
cfca07a
Start to build a red black tree
mo khan
2020-08-28 20:16:06
9746986
Rename node to tree
mo khan
2020-08-28 20:10:00
39859c6
Add more test cases
mo khan
2020-08-28 19:50:18
64d34f3
Perform right left rotation after deletion
mo khan
2020-08-28 19:40:28
5d1b9bb
perform right right rotation after delete
mo khan
2020-08-28 19:29:02
401cf13
Handle left right rotation after delete
mo khan
2020-08-28 17:15:23
4d37cc0
Perform left left rotate after deletion
mo khan
2020-08-28 17:04:23
725027d
add tests for left-right rotation and right-left rotation
mo khan
2020-08-27 20:41:05
bb5614b
Implement a right rotation
mo khan
2020-08-27 20:25:24
e040e02
Add link to lecture video
mo khan
2020-08-27 19:19:36
74a52d2
Insert into root of tree
mo khan
2020-08-27 19:17:17
b7d1b01
Start to create an AVL tree
mo khan
2020-08-27 19:06:52
7082bf3
Add notes on AVL tree
mo khan
2020-08-27 18:57:32
6e52068
Add notes on Binary Heap
mo khan
2020-08-27 18:23:30
67a2c78
Add notes
mo khan
2020-08-27 18:05:33
b8f3a0b
Add notes on red-black tree
mo khan
2020-08-27 17:37:28
5d9ebbb
Draw graph
mo khan
2020-08-26 21:47:12
e3d7861
Add assignment 3 questions
mo khan
2020-08-26 21:40:40
64343a3
Run clang formatter
tag: 2.0.0
mo khan
2020-08-17 01:32:46
5e11cbb
Rebalance tree after each insert
mo khan
2020-08-17 01:24:20
f531d9c
Detect scapegoat and rebalance the tree
mo khan
2020-08-17 01:10:19