-
Not sure what the process for :UpdateTags is, but when I run it on a large amount of source code, the vim process allocates a ton of memory (~7GB, probably more if it was available). I also noticed t…
-
I would like to contribute to this repository by implementing the Quicksort algorithm in C++. Quicksort is a popular sorting algorithm with an average time complexity of O(n log n). It uses the divide…
-
Not seeing any references to an actual docopt formal grammar yet, I am writing a PEG grammar for use in Python with Tatsu (https://tatsu.readthedocs.io). I am hopeful that it will be usable with othe…
-
The meta-computation unrolls the divide-and-conquer some number of times.
This can work for any underlying matmult. We can start with the naive Accelerate one. Then move it over to shallow-fission,…
-
### Name:
```Hirschberg's Algorithm```
### About:
This feature introduces Hirschberg's Algorithm, a space-efficient algorithm for solving the Longest Common Subsequence (LCS) problem. Hirsc…
-
### Have you completed your first issue?
- [X] I have completed my first issue
### Guidelines
- [X] I have read the guidelines
- [X] I have the link to my latest merged PR
### Latest Merged PR Lin…
-
I tried to implement the cube solver. Everything works but the heuristic function is taking to long to create the heuristic database for a depth of 20. I was only able to generate a database with dept…
-
---
### Name:
```Meet in the Middle```
### About:
The Meet in the Middle algorithm is a divide-and-conquer technique used to solve problems with large search spaces, typically when brute…
-
```
Modular decomposition refers to the process of building a modular
decomposition tree. These can yield very interesting properties about
graphs (directed, undirected, and hypergraphs alike). Mo…
-
**Description:**
The goal of this issue is to develop key functions for visualizing and analyzing land use change based on the following development basis: https://github.com/mariaadeliaw/lumens_up…