[NEW ALGORITHM] Kadane's Algorithm

[govindumeesala]

Issue will be closed if:

1. You mention more than one algorithm. You can create a separate issue for each algorithm once the current one is completed.
2. You propose an algorithm that is already present or has been mentioned in a previous issue.
3. You create a new issue without completing your previous issue.

Note: These actions will be taken seriously. Failure to follow the guidelines may result in the immediate closure of your issue.

---

Name:

• Kadane's Algorithm

• Problem Statement: Given an integer array arr, find the contiguous subarray (containing at least one number) which
  has the largest sum and returns its sum and prints the subarray.

About:

Propose a new algorithm to be added to the repository

---

Labels:

new algorithm, gssoc-ext, hacktoberfest, level1

---

Assignees:

• Contributor in GSSoC-ext
• Want to work on it

@pankaj-bind assign me this please