# Descrete Math week 5

**wilden**

**Part V**

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

*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(*n*^{2}), O(*n*^{3}), or some other function of*n*? Explain

- Create a table that depicts the runtime for arrays of length 1 to 10. Would you expect the general runtime to be O(

- 7 years ago
- 20

**Answer(3)**

Purchase the answer to view it

- discreate_math.docx

Purchase the answer to view it

- discrete_maths_solutions.docx

Purchase the answer to view it

- algorithm_analysis_solution.docx

**Bids(1)**

**other Questions(10)**

- Compare the elitist and pluralist theories of power and explain their differences
- Business Communication Paper
- Help with MyMath Lab homework?
- for Johny- Juvenile Delinquency-400–600 words
- need hlep
- genetics assignment
- what is five and one fourth divided by one and one sixth?
- Complete the activities in the attachments.
- Statistics
- you are dealt one card from a 52 deck. Find the probability of being dealt a spade and a...

### Discrete Math help

NOT RATEDAlgorithm 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 …

7 years ago- Consider searching algorithms on the following array of data:
### Maths - Algorithm Analysis Problem

NOT RATEDAlgorithm 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 …

7 years ago### Algorithm Analysis

NOT RATEDAlgorithm 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 …

7 years ago- Consider searching algorithms on the following array of data:
### Part V : Algorithm Analysis

NOT RATEDConsider 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 …7 years ago### for Homework Pro only

NOT RATED**Part V**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 …

6 years ago### Analysis of Algorithms

NOT RATED**Task Background:**This assignment is to include a revised version of parts I-IV from week 4, plus Part V, described below. In part V, you are asked to demonstrate the procedures of …5 years ago### Algorithm Analysis(Part V )

NOT RATEDConsider 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 …5 years ago