Pinned Loading

1. JOB_SCHEDULING_WITHIN_DEADLINE JOB_SCHEDULING_WITHIN_DEADLINE Public

   This the standard algorithm for selecting a jobs among set of jobs so that profit can be maximized with a limitation of having finite number of slots.

   C 2

2. KNAPSACK-PROBLEM KNAPSACK-PROBLEM Public

   This is the Standard Algorithm for selecting the objects which should be put in the KNAPSACK bag with a finite capacity so that profit can be maximized.

   C 2

3. Greedy_Activity_Selector Greedy_Activity_Selector Public

   This is the Standard Algorithm for selecting the maximum set of compatible activity within all given activity assuming having equal weightage .

   C 2

4. OPTIMAL-STORAGE-ON-TAPES OPTIMAL-STORAGE-ON-TAPES Public

   This is the application greedy algorithm for arranging the program according to their retrieval time so that MEAN-RETRIEVAL-TIME can me minimized.

   C 2

5. BINARY_TREE_TRAVERSAL_USING_RECURSION BINARY_TREE_TRAVERSAL_USING_RECURSION Public

   The following program has been proposed for the traversal(inorder , preorder and postorder) in binary tree using recursion. If you can propose some good changes in the code you are most welcome :)

   C 2

6. SORTING SORTING Public

   This Repository contains implementation of some standard Sorting algorithms.

   C 2