what is efficient linear search algorithm on an ordered integer array? Announcing the arrival...

Error "illegal generic type for instanceof" when using local classes

Is it ethical to give a final exam after the professor has quit before teaching the remaining chapters of the course?

Withdrew £2800, but only £2000 shows as withdrawn on online banking; what are my obligations?

What is a non-alternating simple group with big order, but relatively few conjugacy classes?

How widely used is the term Treppenwitz? Is it something that most Germans know?

Apollo command module space walk?

In predicate logic, does existential quantification (∃) include universal quantification (∀), i.e. can 'some' imply 'all'?

Can an alien society believe that their star system is the universe?

Echoing a tail command produces unexpected output?

3 doors, three guards, one stone

The logistics of corpse disposal

Why are Kinder Surprise Eggs illegal in the USA?

List *all* the tuples!

What's the meaning of 間時肆拾貳 at a car parking sign

Using audio cues to encourage good posture

Is there a problem creating Diff Backups every hour instead of Logs and DIffs?

Dating a Former Employee

How to tell that you are a giant?

Book where humans were engineered with genes from animal species to survive hostile planets

How does the particle を relate to the verb 行く in the structure「A を + B に行く」?

What does this icon in iOS Stardew Valley mean?

How to deal with a team lead who never gives me credit?

Why aren't air breathing engines used as small first stages

porting install scripts : can rpm replace apt?



what is efficient linear search algorithm on an ordered integer array?



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 17/18, 2019 at 00:00UTC (8:00pm US/Eastern)What is the time complexity of Euclid's Algorithm (Upper bound,Lower Bound and Average)?What's the most efficient algorithm for Divisibility?Finding average-case time complexityLinear search average-case complexity?What algorithm can sort the first sqrt(n) elements of an array in O(n) time?Recurrence for quaternary search algorithmAverage complexity of linear search with weighted probabilityWrite an algorithm to find an integer in an array.algorithm that determine whether there exists a duplicate integer with expected runtime $O(n)$Given array of numbers $n$, what is the probability that at least k elements will have smaller value than arithmetic average?












0












$begingroup$


what is efficient linear search algorithm on an ordered integer array? and what is the average-case time complexity A(n) when assume that all 2n+1 events(why?) are equally probable?










share|cite|improve this question











$endgroup$

















    0












    $begingroup$


    what is efficient linear search algorithm on an ordered integer array? and what is the average-case time complexity A(n) when assume that all 2n+1 events(why?) are equally probable?










    share|cite|improve this question











    $endgroup$















      0












      0








      0





      $begingroup$


      what is efficient linear search algorithm on an ordered integer array? and what is the average-case time complexity A(n) when assume that all 2n+1 events(why?) are equally probable?










      share|cite|improve this question











      $endgroup$




      what is efficient linear search algorithm on an ordered integer array? and what is the average-case time complexity A(n) when assume that all 2n+1 events(why?) are equally probable?







      algorithms asymptotics computational-complexity






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Mar 24 at 13:11







      bitmapp

















      asked Mar 24 at 10:47









      bitmappbitmapp

      12




      12






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          The standard search algorithm on an ordered array
          Is the binary search which has logarithmic time.



          I'm not sure what you mean by a linear search algorithm.



          I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be
          log log n.






          share|cite|improve this answer









          $endgroup$














            Your Answer








            StackExchange.ready(function() {
            var channelOptions = {
            tags: "".split(" "),
            id: "69"
            };
            initTagRenderer("".split(" "), "".split(" "), channelOptions);

            StackExchange.using("externalEditor", function() {
            // Have to fire editor after snippets, if snippets enabled
            if (StackExchange.settings.snippets.snippetsEnabled) {
            StackExchange.using("snippets", function() {
            createEditor();
            });
            }
            else {
            createEditor();
            }
            });

            function createEditor() {
            StackExchange.prepareEditor({
            heartbeatType: 'answer',
            autoActivateHeartbeat: false,
            convertImagesToLinks: true,
            noModals: true,
            showLowRepImageUploadWarning: true,
            reputationToPostImages: 10,
            bindNavPrevention: true,
            postfix: "",
            imageUploader: {
            brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
            contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
            allowUrls: true
            },
            noCode: true, onDemand: true,
            discardSelector: ".discard-answer"
            ,immediatelyShowMarkdownHelp:true
            });


            }
            });














            draft saved

            draft discarded


















            StackExchange.ready(
            function () {
            StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3160388%2fwhat-is-efficient-linear-search-algorithm-on-an-ordered-integer-array%23new-answer', 'question_page');
            }
            );

            Post as a guest















            Required, but never shown

























            1 Answer
            1






            active

            oldest

            votes








            1 Answer
            1






            active

            oldest

            votes









            active

            oldest

            votes






            active

            oldest

            votes









            0












            $begingroup$

            The standard search algorithm on an ordered array
            Is the binary search which has logarithmic time.



            I'm not sure what you mean by a linear search algorithm.



            I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be
            log log n.






            share|cite|improve this answer









            $endgroup$


















              0












              $begingroup$

              The standard search algorithm on an ordered array
              Is the binary search which has logarithmic time.



              I'm not sure what you mean by a linear search algorithm.



              I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be
              log log n.






              share|cite|improve this answer









              $endgroup$
















                0












                0








                0





                $begingroup$

                The standard search algorithm on an ordered array
                Is the binary search which has logarithmic time.



                I'm not sure what you mean by a linear search algorithm.



                I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be
                log log n.






                share|cite|improve this answer









                $endgroup$



                The standard search algorithm on an ordered array
                Is the binary search which has logarithmic time.



                I'm not sure what you mean by a linear search algorithm.



                I seem to recall reading many years ago that if you do an interpolatory binary search that the average time will be
                log log n.







                share|cite|improve this answer












                share|cite|improve this answer



                share|cite|improve this answer










                answered Mar 24 at 15:27









                marty cohenmarty cohen

                75.7k549130




                75.7k549130






























                    draft saved

                    draft discarded




















































                    Thanks for contributing an answer to Mathematics Stack Exchange!


                    • Please be sure to answer the question. Provide details and share your research!

                    But avoid



                    • Asking for help, clarification, or responding to other answers.

                    • Making statements based on opinion; back them up with references or personal experience.


                    Use MathJax to format equations. MathJax reference.


                    To learn more, see our tips on writing great answers.




                    draft saved


                    draft discarded














                    StackExchange.ready(
                    function () {
                    StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3160388%2fwhat-is-efficient-linear-search-algorithm-on-an-ordered-integer-array%23new-answer', 'question_page');
                    }
                    );

                    Post as a guest















                    Required, but never shown





















































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown

































                    Required, but never shown














                    Required, but never shown












                    Required, but never shown







                    Required, but never shown







                    Popular posts from this blog

                    六本木駅

                    Integral that is continuous and looks like it converges to a geometric seriesTesting if a geometric series converges by taking limit to infinitySummation of arithmetic-geometric series of higher orderGeometric series with polynomial exponentHow to Recognize a Geometric SeriesShowing an integral equality with series over the integersDiscontinuity of a series of continuous functionsReasons why a Series ConvergesSum of infinite geometric series with two terms in summationUsing geometric series for computing IntegralsLimit of geometric series sum when $r = 1$

                    Joseph Lister