Problem Name and Description:
1.Binary-Search: To search a number in an sorted array
2.Max-Min: To find out the maximum and minimum element in an array
3.Merge-Sort: To sort an unsorted array using Merge Sort technique
4.Quick-Sort: To sort an unsorted array using Quick Sort technique.
Problem Name and Description:
1: Fractional Knapsack: Given a set of items, each with a weight and a value, determine the number of each
item to include in a collection so that the total weight is less than or equal to
a given limit and the total value is as large as possible.