Add Ternary Search Algorithm

[atarax665]

Ternary Search

Its a divide and conquer based searching algorithm which is very similar to binary search. Here the array/list is divided into three parts and is determined that which part has the element to be searched. Its time complexity is log(n base 3). I found this algorithm to be missing from this repository.

[ritikverma2000]

I would like to work on this.

[nk636547]

can you please assign me this task
I will contribute today only : )
thanks

[ritikverma2000]

Bro, I am not a maintainer of this repo I was looking to contribute like you only.

[nk636547]

@ritikverma2000 actually i have to contribute because I have to submit my PR link as my technical assessment for Internship......
But I am new to open source contribution.
Can you help me with a good issue to contribute?

[rahulpandey70]

@nk636547 if you want to contribute in open source, visit here https://github.com/rahulpandey70/LeetCode-Questions and contribute freely.

[YashodeepD]

I will solve this issue