n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning
-
Updated
Oct 23, 2017 - C#
n-Queens [Completion] problem solver implemented as multithreaded randomized non-recursive backtracking algorithm with dam-pruning
🍓 non-recursive method of flattening an array or arrays and unflattening the result
A program made in Algorithms and Complexity class. It's the java implementation of the non recursive binary search.
algorithm examples in java
Yet Another GNU Make framework
Implementation of Non-recursive Tree traversal Algorithms
2019 // School projects for CEN345 - Algorithms
Go`s generics AVL based sorted map
Solves Sudoku puzzles fast by eliminating potential values in cells. If that fails, it completes the puzzle using backtracking.
Implementations of various compiler tools.
Digital FIR and IIR filters with intelligible Python codes using SciPy.
A toy self-compiling C compiler.
A minimal ray tracing engine.
Generating all N! permutations of the numbers 0 to N-1.
Magefile - (mostly) automatic makefile template
A non-recursive Make system which supports GCC, CLANG, MS VC++, JAVAC, DPKG, DOXYGEN and many more targets.
Add a description, image, and links to the non-recursive topic page so that developers can more easily learn about it.
To associate your repository with the non-recursive topic, visit your repo's landing page and select "manage topics."