GitHub - aliardaeker/Well-Known-Algorithms: Programs to simulate many well known problems with their solutions written with C++. Exchange, insertion, merge, randomized quick sort. Heap sort with radix, large integer multiplication, strassen matrix multiplication, floyd algorithm, largest common substring, prim`s and kruskal`s MST algorithms, knapsack problem.

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
Exchange_Insertion_Merge_and_Randomized_Quick_Sort.cpp		Exchange_Insertion_Merge_and_Randomized_Quick_Sort.cpp
LICENSE		LICENSE
ReadMe.txt		ReadMe.txt
eker_ali_pa2_heap_radix.cpp		eker_ali_pa2_heap_radix.cpp
eker_ali_pa2_lim.cpp		eker_ali_pa2_lim.cpp
eker_ali_pa2_strassen.cpp		eker_ali_pa2_strassen.cpp
eker_ali_pa3_floyd.cpp		eker_ali_pa3_floyd.cpp
eker_ali_pa3_lcs.cpp		eker_ali_pa3_lcs.cpp
eker_ali_pa4_prim_kruskal.cpp		eker_ali_pa4_prim_kruskal.cpp
eker_ali_pa5_knapsack.cpp		eker_ali_pa5_knapsack.cpp

Repository files navigation

C++ Programs to simulate essential algorithm concepts such as searching, recursion, graph theory, matrix multiplication and backtracking with random inputs.

1) Exchange, insertion, merge, randomized quick sort. 

2) Heap sort with radix, large integer multiplication, Strassen matrix multiplication.

3) Floyd algorithm, largest common substring.

4) Prim`s and Kruskal`s  MST algorithms.

5) Knapsack problem with brute force, dynamic programming and backtraking solutions.

About

Programs to simulate many well known problems with their solutions written with C++. Exchange, insertion, merge, randomized quick sort. Heap sort with radix, large integer multiplication, strassen matrix multiplication, floyd algorithm, largest common substring, prim`s and kruskal`s MST algorithms, knapsack problem.

Readme

MIT license