Binary and linear Search Algos

[shubhamc1200]

🚀 Feature

(A clear and concise description of what the feature is.)

Have you spent some time to check if this issue has been raised before?

No, this hasn't been raised earlier

Have you read the Contributing Guidelines?

Yes

Pitch

Want to add the basic Linear and Binary search algos.

Linear search: Start from the leftmost element of arr[] and one by one compare x with each element of arr[].(A loop is used).Here one doesn't have to sort the array.
Binary Search: Search a sorted array by repeatedly dividing the search interval in half.

TIME COMPLEXITY:
Linear search :O(n)
Binary Search: O(log n)

[Anubhav Pabby]

Could you assign me this task?

[Avinash Vijayvargiya]

Could you assign me this task?

[shubhamc1200]

Hey @AnubhavPabby Ive raised this same issue before so you have to wait according to guidelines.

[Sarvesh Dubey]

@shubhamc1200 please review the repo first before submitting the PR, we already have the search algorithms