Skip to content
#

greedy-algorithms

Here are 182 public repositories matching this topic...

Contains code from assignments in my Data Structures and Algorithms course. Coursework explored numerous sorting algos, algorithmic analysis, greedy algos, recursion, and dynamic programming. Data structures covered in our course include: arrays, stacks, queues, linked lists, min/max priority heaps, binary trees, B-trees, and an intro to graphs

  • Updated Jan 11, 2024
  • Java

There is a robot for a library.A sample input file is given below. The first 10 rows represent the adjacency matrix. Then, each room’s name is followed by weight and number of pages of books in 5 rooms. Knapsack algorithm is for maximaxing the total number of pages (it can pick total of 5 kilograms of books from 5 rooms )and Prim algorithm is used.

  • Updated Jun 5, 2019
  • Java

implementation of dynamic and greedy approach solution for a problem. Which is a car company that produces given amount of cars every month with investments, profits costs etc. Profits are from car sales and investments.

  • Updated Jul 18, 2020
  • Java

Improve this page

Add a description, image, and links to the greedy-algorithms topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the greedy-algorithms topic, visit your repo's landing page and select "manage topics."

Learn more