Added Merge Sort , Bubble sort and Heap Operations with Python

[prkhrv]

Description

• Added the algorithm for merge sort and bubble sort.

Related Issue

fixes #204
fixes #201

Types of changes

What types of changes does your code introduce? Put an x in all the boxes that apply:

• New Algorithm (non-breaking change which adds functionality)

Checklist:

• My code follows the code style of this project.

• I have read the CONTRIBUTING document.

[GnikDroy]

It is fine since it is your first time. But please comment on the issue before you put up a pull request. Multiple people seemed to be working on this issue. Take that into consideration from next time. Anyway welcome to the project.

[GnikDroy]

Please name your variables properly. One letter variables are very unconventional. As has already been said, could you please revise PEP8.

[prkhrv]

@GnikDroy Sorry I didn't know. I will Comment before making a PR next time. and I have renamed the variables as you recommended.

[GnikDroy]

@prkhrv No problem. Happens to the best of us. This is your first time contributing anyway.

Could you keep the bubble sort algorithm in a function? Write some code that sorts a test array and prints out to screen. This will help us check your algorithm. Also, could you rename your variables in mergesort as well. Also, take @punkyoon advice and read the PEP8. It will help you.

[GnikDroy]

@prkhrv Can you remove heap sort and implement a heap instead? You said in #206 you would contribute in heap. Heap Sort is #202 which was assigned to @punkyoon and is addressed by pull request #213

[prkhrv]

Oh! Yeah, Now i saw that , I will sure :)