We welcome contributions to the Design and Analysis of Algorithms (DAA) Lab repository. This document outlines the guidelines for contributing to ensure a consistent and collaborative experience.
- Navigate to the repository.
- Click the Fork button to create a copy of the repository in your account.
Clone the forked repository to your local machine:
git clone https://github.com/yourusername/algorithms.git
cd DAA-algorithmsCreate a new branch for your changes:
git checkout -b feature/your-feature-name- Navigate to the relevant topic folder (e.g.,
DivideAndConquer/,DynamicProgramming/) and add or modify code. - Follow consistent coding styles:
- Proper indentation
- Meaningful variable names
- Add comments explaining complex parts of the code
- Ensure your code runs without errors.
- Test with multiple inputs to validate correctness and robustness.
Commit your changes with a descriptive message:
git add .
git commit -m "Add code for [specific algorithm or feature]"Push your branch to your forked repository:
git push origin feature/your-feature-name- Go to the original repository.
- Click on the Pull Requests tab and select New Pull Request.
- Select your branch and provide a detailed description of your changes.
- Submit the pull request.
- Ensure your code is relevant to the syllabus and fits within the existing structure.
- Clearly explain your code with inline comments and, if needed, in a separate
README.mdwithin the folder. - Write clean, efficient, and modular code.
- Use consistent naming conventions for files and variables.
- Avoid unnecessary dependencies; stick to the standard libraries whenever possible.
- Add missing algorithms or techniques from the syllabus.
- Optimize existing code for better time or space complexity.
- Provide alternate solutions for existing problems using different paradigms.
- Improve documentation in
README.mdor add explanations for new code. - Fix typos or clarify ambiguous instructions.
- Report bugs or incorrect outputs.
- Add test cases for existing algorithms to handle edge cases.