keon / algorithms

Minimal examples of data structures and algorithms in Python
MIT License
24.09k stars 4.61k forks source link

Add Ternary Search Algorithm #749

Open atarax665 opened 3 years ago

atarax665 commented 3 years ago

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 commented 3 years ago

I would like to work on this.

nk636547 commented 3 years ago

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

ritikverma2000 commented 3 years ago

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

nk636547 commented 3 years ago

@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 commented 3 years ago

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

YashodeepD commented 1 year ago

I will solve this issue