DAA

Solution of some popular problems using greddy algorithms, backtracking and dynamic programming.....

Name		Name	Last commit message	Last commit date
Latest commit History 21 Commits
Graphs		Graphs
SegmentTree		SegmentTree
Sorting		Sorting
Trie		Trie
.gitignore		.gitignore
10_N-Queens-problem.c		10_N-Queens-problem.c
11_m-coloring_problem.c		11_m-coloring_problem.c
12_hamiltonian_cycle.c		12_hamiltonian_cycle.c
13_MatrixChainMultiplication.c		13_MatrixChainMultiplication.c
14_floyd's_algo.c		14_floyd's_algo.c
15_bellmanFord_algo.c		15_bellmanFord_algo.c
16_BFS.c		16_BFS.c
17_DFS.c		17_DFS.c
18_15puzzle_probelm.c		18_15puzzle_probelm.c
1_binary_search.c		1_binary_search.c
2_quick_sort.c		2_quick_sort.c
3_merge_sort.c		3_merge_sort.c
4_minMax_by_divide&Conquer.c		4_minMax_by_divide&Conquer.c
5_knapsack_greedy.c		5_knapsack_greedy.c
6_0by1_knapsack.c		6_0by1_knapsack.c
7_jobSequencing_greddy.c		7_jobSequencing_greddy.c
8_prim's_algo.c		8_prim's_algo.c
9_kruskal_algo.c		9_kruskal_algo.c
DAA Lab Assignment 2022.pdf		DAA Lab Assignment 2022.pdf
README.md		README.md
gmon.out		gmon.out

Provide feedback