Alpha Geek

(8)

$10/per page/Negotiable

About Alpha Geek

Levels Tought:
University

Expertise:
Accounting,Algebra See all
Accounting,Algebra,Architecture and Design,Art & Design,Biology,Business & Finance,Calculus,Chemistry,Communications,Computer Science,Environmental science,Essay writing,Programming,Social Science,Statistics Hide all
Teaching Since: Apr 2017
Last Sign in: 438 Weeks Ago, 2 Days Ago
Questions Answered: 9562
Tutorials Posted: 9559

Education

  • bachelor in business administration
    Polytechnic State University Sanluis
    Jan-2006 - Nov-2010

  • CPA
    Polytechnic State University
    Jan-2012 - Nov-2016

Experience

  • Professor
    Harvard Square Academy (HS2)
    Mar-2012 - Present

Category > Math Posted 20 Apr 2017 My Price 10.00

Algorithm Analysis

Algorithm Analysis

  • Consider searching algorithms on the following array of data:

    [22 21 9 4 16 2 10 14 20 31 26 19 17 28 8 13]

    Suppose you want to implement a searching algorithm to see if the data set contains the number 19. Demonstrate how the search would go if you used:

    • A sequential search
    • A binary search
    State the runtime for each of the searches, in this example, and for general data sets of size n. Address the issue of the order of the data in binary searching.
  • Suppose an algorithm that processes a data set of size 8 has a runtime of 72. The same algorithm has a runtime of 110 when applied to a data set of size 10; and when applied to a data set of size 20, it has a runtime of 420. Using big-O notation, state the runtime for this algorithm for the general case of a data set of size n.
  • Suppose you develop an algorithm that processes the first element of an array (length of n), then processes the first 2 elements, then the first 3 elements, and so on, until the last iteration of a loop, when it processes all elements. Thus, if n = 4, the runtime would be 1 + 2 + 3 + 4 = 10. 
    Create a table that depicts the runtime for arrays of length 1 to 10. Would you expect the general runtime to be O(n), O(n2), O(n3), or some other function of n? Explain

Answers

Alpha Geek
(8)
Status NEW Posted 20 Apr 2017 09:04 AM My Price 10.00

-----------

Attachments

file 1492680901-aa_aa_aa_discreate_math.docx preview (337 words )
A-----------nsw-----------erB-----------ina-----------ry -----------Sea-----------rch----------- is----------- an----------- in-----------cre-----------dib-----------ly -----------pow-----------erf-----------ul -----------tec-----------hni-----------que----------- fo-----------r s-----------ear-----------chi-----------ng -----------an -----------ord-----------ere-----------d l-----------ist-----------. I-----------t i-----------s f-----------ami-----------lia-----------r t-----------o e-----------ver-----------yon-----------e w-----------ho -----------use-----------s a----------- te-----------lep-----------hon-----------e b-----------ook-----------! -----------The----------- ba-----------sic----------- al-----------gor-----------ith-----------m i-----------s t-----------o f-----------ind----------- th-----------e m-----------idd-----------le -----------ele-----------men-----------t o-----------f t-----------he -----------lis-----------t, -----------com-----------par-----------e i-----------t a-----------gai-----------nst----------- th-----------e k-----------ey,----------- de-----------cid-----------e w-----------hic-----------h h-----------alf----------- of----------- th-----------e l-----------ist----------- mu-----------st -----------con-----------tai-----------n t-----------he -----------key-----------, a-----------nd -----------rep-----------eat----------- wi-----------th -----------tha-----------t h-----------alf-----------. -----------Two----------- re-----------qui-----------rem-----------ent-----------s t-----------o s-----------upp-----------ort----------- bi-----------nar-----------y s-----------ear-----------ch:----------- R-----------and-----------om -----------acc-----------ess----------- of----------- th-----------e l-----------ist----------- el-----------eme-----------nts-----------, s-----------o w-----------e n-----------eed----------- ar-----------ray-----------s i-----------nst-----------ead----------- of----------- li-----------nke-----------d l-----------ist-----------s.
Not Rated(0)
Relevent Questions