CC-08-Design-and-Analysis-of-Algorithms

This repository contains code and related materials for the Design and Analysis of Algorithms course.

Practical Folder

The practical folder contains C programs that implement various algorithms and data structures. Here's a list of the programs:

1. algorithm_kruskal.c
2. algorithm_prim.c
3. algorithm_string_matching_KMP.c
4. algorithm_string_matching_native.c
5. binary_search_tree.c
6. binary_search_tree_sort.c
7. binary_search_tree_traversal.c
8. binary_tree_traversal.c
9. gcd_recursive.c
10. graph_bfs_spanning_tree.c
11. graph_dfs_spanning_tree.c
12. graph_find_all_path.c
13. graph_minimum_spanning_tree.c
14. heap_binary_max.c
15. heap_binary_min.c
16. heap_binary_sort_asc.c
17. heap_binary_sort_desc.c
18. heap_k_ary_max.c
19. heap_k_ary_min.c
20. heap_k_ary_sort.c
21. heap_max.c
22. heap_min.c
23. helloWorld.c
24. linked_list.c
25. matrix_addition_iterative.c
26. matrix_addition_recursive.c
27. matrix_chain_multiplication.c
28. matrix_determinant.c
29. matrix_determinant_iterative.c
30. matrix_determinant_recursive.c
31. matrix_multiply_iterative.c
32. matrix_multiply_recursive.c
33. matrix_subtract_iterative.c
34. matrix_subtract_recursive.c
35. multiply_n_natural_recursive.c
36. prime_upto_n.c
37. prime_upto_n_efficient.c
38. sort_bubble_iterative.c
39. sort_bubble_recursive.c
40. sort_bucket.c
41. sort_counting.c
42. sort_insertion.c
43. sort_merge.c
44. sort_quick.c
45. sort_radix.c
46. sort_selection.c
47. sum_n_natural_recursive.c
48. tree_red_black.c
49. tree_red_black_del.c

Feel free to explore these implementations. They should provide a practical understanding of the concepts in the Design and Analysis of Algorithms course.

Other Folders

• docs: Contains documents related to practical assignments and past year questions.
• internal: Contains internal assignment submissions.
• presentation: Contains a PowerPoint presentation on the course content.

License

This project is licensed under the Unlicense license - see the LICENSE file for details.

Contributing

Contributions are welcome. Please open an issue to discuss your idea before making a pull request.

Contact

If you have any questions or feedback, please reach out to me at my GitHub profile, dhrubasaha08.