| Age | Commit message (Collapse) | Author | |
|---|---|---|---|
| 2024-07-17 | New file for quicksort algorithm | Aryadev Chavali | |
| 2024-07-17 | Tons of solutions | Aryadev Chavali | |
| 2024-04-29 | Moved implementations to folder | Aryadev Chavali | |
| 2023-07-10 | (*)~fixed makefile clean recipe | Aryadev Chavali | |
| 2023-07-10 | (bsearch)+algorithm implementation | Aryadev Chavali | |
| Reads lines from "bsearch.txt", asks user for a number then binary searches that number in the input data from "bsearch.txt". | |||
| 2023-07-10 | (bsearch)+Elisp script to generate random values in bsearch.txt | Aryadev Chavali | |
| Generates *LIST-SIZE* number of random numbers (within bounds 0, *UPPER-BOUND*) and inserts them one by one into bsearch.txt. Each number is separated by a newline. | |||
| 2023-07-10 | (*)+bsearch to makefile recipes, +ignoring *.txt files | Aryadev Chavali | |
| 2023-07-10 | (powerset)+some tests for powerset | Aryadev Chavali | |
| 2023-07-09 | (powerset)~Common Lisp -> Racket | Aryadev Chavali | |
| Decided to try my hand at racket, fundamentally the algorithm is the same and code structure is basically the same anyway. Just looks cleaner. | |||
| 2023-07-09 | (*)+MIT License | Aryadev Chavali | |
| Should start licensing stuff just to avoid a headache later! | |||
| 2023-07-09 | (list)+constructor for List, ~cleaned up some code | Aryadev Chavali | |
| Same argument as btree | |||
| 2023-07-09 | (Makefile)~modified to be slightly more agnostic | Aryadev Chavali | |
| I'm going to add recipes for other language implementations of certain algorithms so as long as you have the correct background programs it just requires a make call to run the program. | |||
| 2023-07-09 | (btree)+constructor for structure, cleaned up some code | Aryadev Chavali | |
| Might as well use C++ features if I've got them | |||
| 2023-06-25 | (powerset)+lisp program for finding power sets | Aryadev Chavali | |
| Working on it right now, just a copyright and documentation so far. | |||
| 2023-06-25 | (*)~changed up makefile recipes, cleaned up README | Aryadev Chavali | |
| 2023-06-25 | (*)~reworking this project | Aryadev Chavali | |
| 2021-11-26 | (General)~forgot to format my files | Aryadev Chavali | |
| Need to remember to format before each commit | |||
| 2021-11-23 | (btree)+basic main test for insert | Aryadev Chavali | |
| 2021-11-23 | (btree)+recursive insert algorithm | Aryadev Chavali | |
| Just checks the value of the current node against value, assesses if the leaf it needs to store it in is a NULL or not, then either allocates to that leaf or recursively calls insert on that leaf (so it may sort the value). Uses pointer magic for some cleaner code. | |||
| 2021-11-23 | (btree)+struct for binary tree | Aryadev Chavali | |
| Has a custom enum for ordering, as each type of data may have its own comparator system. Hence, each node will have a comparison function pointer internally. Though this increases the data required to create a binary tree, it does make it easier to support multiple types. | |||
| 2021-11-23 | (General)~extract valgrind memcheck flags to VFLAGS variable | Aryadev Chavali | |
| 2021-11-23 | (General)+ggdb flag to CFLAGS makefile | Aryadev Chavali | |
| 2021-11-23 | (General)~memcheck recipes now has --show-leak-kinds=all | Aryadev Chavali | |
| 2021-11-22 | (btree)+binary tree cpp file with recipes in makefile | Aryadev Chavali | |
| 2021-11-22 | (list)+some flavour text for list program output | Aryadev Chavali | |
| 2021-11-22 | (list)+filter function | Aryadev Chavali | |
| This generates a new list, and appends to it every time the current list value satisfies the condition. It then recursively calls the filter on the next value. | |||
| 2021-11-22 | (list)+reduce function | Aryadev Chavali | |
| Basically accumulates values, check https://en.wikipedia.org/wiki/Fold_(higher-order_function) for more detail. | |||
| 2021-11-22 | (list)+example for map in main | Aryadev Chavali | |
| 2021-11-22 | (list)+map function | Aryadev Chavali | |
| void return, just maps f onto every value in the linked list till nullity. | |||
| 2021-11-22 | (list)~NULL -> nullptr | Aryadev Chavali | |
| C++ styling. | |||
| 2021-11-21 | (list)+recursive reverse algorithm for singly linked lists | Aryadev Chavali | |
| Pretty simple, returns the last node as that's the new root node. Uses default parameters to make sure the first node has next set to null. | |||
| 2021-11-21 | (list)+general style change, use unary switches for checking null | Aryadev Chavali | |
| 2021-11-20 | (General)+makefile for common recipes that I'll use in this project | Aryadev Chavali | |
| Just write a few lines and it saves so much time. Don't try to automate it too much though. | |||
| 2021-11-20 | (list)+destructor function in struct | Aryadev Chavali | |
| Nice feature of C++, destructors make it kinda nice to do memory management. Though they don't fully reduce the pain lol | |||
| 2021-11-20 | (list)+first test with appends and output | Aryadev Chavali | |
| Main now uses append and cout mechanisms for a simple program! | |||
| 2021-11-20 | (list)+simple output mechanism via C++ streams | Aryadev Chavali | |
| cout has inbuilt support for multiple types, easier than using printf. Just have to ease the compiler into it | |||
| 2021-11-20 | (list)~struct List is not necessary | Aryadev Chavali | |
| Slight whiplash from change to C++, can just use typename now. | |||
| 2021-11-20 | (list)+list.cpp file | Aryadev Chavali | |
| Will have all the singly linked list algorithms I can think of, using the structure I have defined (template based singly linked list) and the simple append function I have added that also acts as the main method of creating an instance. | |||
| 2021-11-20 | (General)+readme | Aryadev Chavali | |
 |
index : algorithms | |
| Terrible repository for common algorithms | Aryadev Chavali <aryadev@aryadevchavali.com> |
| aboutsummaryrefslogtreecommitdiff |