https://github.com/sathish111j/design-and-analysis-of-algorithm

Contains code for most of the Design And Analysis problems
https://github.com/sathish111j/design-and-analysis-of-algorithm

Last synced: about 2 months ago
JSON representation

Contains code for most of the Design And Analysis problems

• Host: GitHub
• URL: https://github.com/sathish111j/design-and-analysis-of-algorithm
• Owner: Sathish111j
• Created: 2023-11-24T17:35:02.000Z (about 1 year ago)
• Default Branch: main
• Last Pushed: 2023-12-09T11:56:06.000Z (about 1 year ago)
• Last Synced: 2023-12-09T12:33:27.881Z (about 1 year ago)
• Language: Python
• Size: 19.5 KB
• Stars: 1
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README.md

Awesome Lists containing this project

README

        
# DAA (Data Structure and Algorithm Analysis)

Welcome to the DAA repository, a curated collection of enchanting algorithms and data structures! Each subfolder holds a unique spell to tackle common problems in the magical realm of computer science.

## Contents

### 1. ConnectedComponents

- **Disjoint Set Union (DSU):** Python implementation for discovering connected components.

### 2. Dynamic Programming

- **01KnapSack:** Solutions to the classic 0/1 Knapsack problem.

- **Fibonacci Sequence:** Various methods for computing the Fibonacci sequence.

- **Matrix Chain Multiplication:** Algorithms for efficient matrix chain multiplication.

### 3. Greedy Problems

- Implementations of various greedy algorithms including Activity Selection, Coin Change, Huffman Coding, Knapsack, and Task Scheduling.

### 4. Minimum Spanning Tree

- Algorithms for finding minimum spanning trees in graphs, including Boruvka's, Kruskal's, and Prim's algorithms.

### 5. Others

- Miscellaneous algorithms like Closest Pair, Matrix Multiplication, Max Subarray problem, and Strassen's Method.

### 6. Shortest Path

- Solutions to shortest path problems in graphs, including Bellman-Ford, Dijkstra's, and Floyd-Warshall algorithms.

### 7. Sorting

- A variety of sorting algorithms such as Heap Sort, Bubble Sort, Bucket Sort, Counting Sort, Insertion Sort, Merge Sort, Quick Sort, and Radix Sort.

### 8. Traversal

- Implementations of Breadth-First and Depth-First Search algorithms.

## Usage

To use these magical spells, simply navigate to the desired subfolder and choose the specific spell you need. Each script is written in Python and can be run independently.

## Contributing

Contributions to this magical repository are welcome. Please ensure that any pull requests are well-documented and adhere to the existing structure for consistency.

## Note

The `.idea` folder is related to an IDE and is not part of the algorithms.