Skip to content
/ Algorithm_Design Public

Implementation of different essential algorithm and their supporting non build-in data structure

4 stars 0 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

sir-rasel/Algorithm_Design

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
0_1_BFS.cpp
0_1_BFS.cpp
 
 
0_1_knapsnack.cpp
0_1_knapsnack.cpp
 
 
BFS_GenarelMethod.cpp
BFS_GenarelMethod.cpp
 
 
BFS_in_2d_grid.cpp
BFS_in_2d_grid.cpp
 
 
Big_mod.c
Big_mod.c
 
 
Binary_search.c
Binary_search.c
 
 
DFS_GenerelMethod.cpp
DFS_GenerelMethod.cpp
 
 
Euler_Sieve_totient_function.cpp
Euler_Sieve_totient_function.cpp
 
 
Euler_totient_function.cpp
Euler_totient_function.cpp
 
 
KMP_string_match.cpp
KMP_string_match.cpp
 
 
MillarRobin_primality_test.cpp
MillarRobin_primality_test.cpp
 
 
README.md
README.md
 
 
Sum_of_divisor.c
Sum_of_divisor.c
 
 
bellmanFordSingleSourceShortestPath.cpp
bellmanFordSingleSourceShortestPath.cpp
 
 
bigIntegerStringImplementation.cpp
bigIntegerStringImplementation.cpp
 
 
binaryIndexedTree.cpp
binaryIndexedTree.cpp
 
 
bitwise_sieve.cpp
bitwise_sieve.cpp
 
 
coinChange_numberOFWay.cpp
coinChange_numberOFWay.cpp
 
 
determine_prime.c
determine_prime.c
 
 
dijakstraSingleSourceShortestPath.cpp
dijakstraSingleSourceShortestPath.cpp
 
 
disjointSet_unionFind.cpp
disjointSet_unionFind.cpp
 
 
egcd.cpp
egcd.cpp
 
 
euclic_gcd.c
euclic_gcd.c
 
 
euler_segment_phi.cpp
euler_segment_phi.cpp
 
 
fermat_primality_test.cpp
fermat_primality_test.cpp
 
 
fibonacciWithMatrixExponentiation.cpp
fibonacciWithMatrixExponentiation.cpp
 
 
find_all_factor.c
find_all_factor.c
 
 
findingMaxMinRecursively.cpp
findingMaxMinRecursively.cpp
 
 
floydCycleFinding.cpp
floydCycleFinding.cpp
 
 
graph_warshall_shortest_path.c
graph_warshall_shortest_path.c
 
 
heapSortCode.cpp
heapSortCode.cpp
 
 
huffmanEncoding.cpp
huffmanEncoding.cpp
 
 
interpolation_search.c
interpolation_search.c
 
 
kruskalForMinimumCostSpanningTree.cpp
kruskalForMinimumCostSpanningTree.cpp
 
 
least_common_divisor.c
least_common_divisor.c
 
 
merge_sort.c
merge_sort.c
 
 
merging_algorithm.c
merging_algorithm.c
 
 
nQueenProblemBacktraking.cpp
nQueenProblemBacktraking.cpp
 
 
numberOfRotationInCircularSortedArray.cpp
numberOfRotationInCircularSortedArray.cpp
 
 
number_of_divisor.c
number_of_divisor.c
 
 
permutationGenerateWithoutUsingExtraVector.cpp
permutationGenerateWithoutUsingExtraVector.cpp
 
 
permutation_generator.cpp
permutation_generator.cpp
 
 
prime_factorization.c
prime_factorization.c
 
 
primsForMinimumSpanningTree.cpp
primsForMinimumSpanningTree.cpp
 
 
quick_sort.c
quick_sort.c
 
 
robinCarp_stringMatching_hashing.cpp
robinCarp_stringMatching_hashing.cpp
 
 
segmentTree.cpp
segmentTree.cpp
 
 
segmentTreeWithLazyPropagation.cpp
segmentTreeWithLazyPropagation.cpp
 
 
segmented_sieve.cpp
segmented_sieve.cpp
 
 
sieve_of_erathothenes.c
sieve_of_erathothenes.c
 
 
subset_genarate_using_recursionWithRescue.cpp
subset_genarate_using_recursionWithRescue.cpp
 
 
ternarySearch.cpp
ternarySearch.cpp
 
 
travelingSalesPersonProblem.cpp
travelingSalesPersonProblem.cpp
 
 
trie_dataStructure.cpp
trie_dataStructure.cpp
 
 

Repository files navigation

Algorithm_Design

Description

This is a data structure and algorithm made by myself. Basically all codes are design as they can be used in competitive programming. But feel free for using this library.
Implementation of different essential algorithm and their supporting non build-in data structure.
Generally there stay some essential and well know algorithm whose we use our general 'software engineering'.
Those algorithm are mostly suitable for "Competative programming".
This can be used as a supporting role of university "Algorithm Design" course.

Content Pattern

  1. Basic data structure
  2. Sortng Algorithm
  3. Searchng Algorithm
  4. Tree Algorithm
  5. Graph Algorithm
  6. Dynamic programming efficient implementation etc.

Conclusion

Feel free for any kind of bug fixing and changes. Also feel free for using this libraries code for many purpose.

About

Implementation of different essential algorithm and their supporting non build-in data structure

Topics

algorithm algorithms data-structures

Resources

Readme
Activity

Stars

4 stars

Watchers

1 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages