summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
2020-10-11feat: complete some practice questionsHEADmastermo khan
2020-10-11docs: improve formatting for all questionsmo khan
2020-10-11docs: improve question 1 formattingmo khan
2020-10-11docs: convert sample final exam from pdf to markdownmo khan
2020-09-27Remove old getting started instructionsmo khan
2020-09-27docs: Document input parameters for matrix_traverse function3.0.0mo khan
2020-09-27Add link to READMEmo khan
2020-09-27docs: document each functionmo khan
2020-09-27docs: Add documentation for AVL treemo khan
2020-09-26style: run cclang formattermo khan
2020-09-26chore: update fmt task to format one dir upmo khan
2020-09-26docs: small formatting updatesmo khan
2020-09-26docs: add headings to assignment 3mo khan
2020-09-26Collapse all questions into a single READMEmo khan
2020-09-26Merge 02 -> READMEmo khan
2020-09-2601 -> READMEmo khan
2020-09-26feat: prove that height of binary tree is greater than or equal to log2(k) ↵mo khan
where k is the # of leaves in the tree
2020-09-26feat: build a meldable heapmo khan
2020-09-26Split diagrams upmo khan
2020-09-26Extract adjacency matrix into separate filesmo khan
2020-09-26feat: implement backtracking algorithm to visit each edge in both directionsmo khan
2020-09-26feat: work on algorithm to find path that traverses each edges in both ↵mo khan
directions
2020-09-26docs: provide visual representation of an adjacency matrixmo khan
2020-09-26docs: add visualization of traversing graph via bfsmo khan
2020-09-26docs: add visualization of dfsmo khan
2020-09-26Add some notes on how to implement a proofmo khan
2020-09-20docs: add visual for each AVL rotationmo khan
2020-09-20docs: add source code from book as starting point to modifymo khan
2020-09-20docs: add code that question is based onmo khan
2020-09-20docs: print output of merge/quick sortmo khan
2020-09-20refactor: make private function staticmo khan
2020-09-20docs: complete question 3mo khan
2020-09-20docs: update illustration for question 1mo khan
2020-09-20refactor: rename colour() to change_colour()mo khan
2020-09-20docs: updates steps to colour avl tree to rb treemo khan
2020-09-20test: convert large avl tree to rb treemo khan
2020-09-20refactor: change colouring algorithmmo khan
2020-09-20test: ensure rb node parents are equalmo khan
2020-09-20feat: print rb node parent in #inspectmo khan
2020-09-20fix: assign rb tree parent when converting from avl treemo khan
2020-09-20test: add assertions to check rb tree validitymo khan
2020-09-20test: add test to ensure is valid returns truemo khan
2020-09-20test: ensure red-black fails when any criteria is invalidmo khan
2020-09-20test: add test to validate rb tree with red rootmo khan
2020-09-08refactor: rename connected to has_edgemo khan
2020-09-07test: add test to check if vertices are connectedmo khan
2020-09-07refactor: inline variable declarationsmo khan
2020-09-07feat: record edges in graphmo khan
2020-09-07docs: add notes on binary triemo khan
2020-09-07docs: add notes on graphsmo khan
generated by cgit v1.2.3 (git 2.39.1) at 2026-02-01 22:31:34 +0000