A Library of useful algorithms for C programming to make your applications simple to understand and easy to use.
-
Breadth First Search Algorithm :is an algorithm for traversing or searching tree or graph data structures. It starts at the tree root (or some arbitrary node of a graph, sometimes referred to as a 'search key') and explores the neighbor nodes first, before moving to the next level neighbors.
-
MDB : This program accesses the BugTypes.mdb database, creates a dataset, adds the tables to it, and displays the number of tables, columns, and rows. It also displays the titles of each row.
-
PolynomialRoot_NewtonMethod : is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function
-
ReadFile : read a file in c
-
dijkstra : shorthest path in the DAG
-
factorial : the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n
-
mergesort : is an efficient, general-purpose, comparison-based sorting algorithm. Most implementations produce a stable sort
-
quicksort : Quicksort is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order. Developed by Tony Hoare in 1959
Please open an issue for support.
Please contribute using Github Flow. Create a branch, add commits, and open a pull request.