Scholars Central

Research articlePublished 2016

A Search Algorithm

Authors: Behera BC

Journal of Applied & Computational Mathematics

Volume 5 · Issue 4 · Pages 1–2

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

This is an algorithm which has the same time complexity as that of linear search of “O (n)”. But still it is better than “linear search” in terms of execution time. Let A[ ] be the array of some size N. If the element which we want to search is at any position before “N/2” than “my-search and linear-search” both will have execution time, but the magic happens when the search element is after “N/2” position. Suppose the element want to search is at nth position, then using the linear search will find the element after nth iteration, but using “my-search” we can search the element after 1st iteration itself. Elements in (N-i)th position can be found in the (I+1)th iteration i.e. suppose size is 1000 than element in 1000th position can be found in 1st iteration, similarly 999 in 2nd iteration and process goes on like this.

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in Journal of Applied & Computational Mathematics.

All its articles

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalJournal of Applied & Computational Mathematics
  • SubjectMathematics & Statistics
  • BylineArticles whose byline prints “Behera BC”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels