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
Solves Sudoku puzzles fast by eliminating potential values in cells. If that fails, it completes the puzzle using backtracking.
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
Implementations of various compiler tools.
2019 // School projects for CEN345 - Algorithms
A minimal ray tracing engine.
Go`s generics AVL based sorted map
Digital FIR and IIR filters with intelligible Python codes using SciPy.
A toy self-compiling C compiler.
Magefile - (mostly) automatic makefile template
🍓 non-recursive method of flattening an array or arrays and unflattening the result
Generating all N! permutations of the numbers 0 to N-1.
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."