Skip to content

Latest commit

 

History

History
37 lines (23 loc) · 958 Bytes

File metadata and controls

37 lines (23 loc) · 958 Bytes

Algorithm-Analysis-and-Design-AAD

This repository contains implementations of various algorithms such as divide and conquer,Greedy and Backtracking etc.

aad

Algorithms Implemented

Divide and Conquer

  • Minimum and maximum value in an array
  • Quick sort

Greedy Algorithms

  • Fractional Knapsack

Installation and Testing

To test and modify algorithms implemented in this repository, follow these steps:

  1. Clone the repository:

    git clone https://github.com/https://github.com/GECI-IT-2020-24/Algorithm-Analysis-and-Design-AAD
  2. compile and run the tests in each folder using

       chmod +x ./test.sh
       ./test.sh
  3. currently used c compiler is clang and linker is mold.Change the compiler and linker in makefile.

Contribution

Feel free to contribute : )