I have to write 1 page of analysis of alogrithms with supporting graph

Question Description
Part I
Suppose you have the following array of data: {4, 5, 7, 11, 20, 24, 31, 35, 40, 45, 50}.
- Explain how you precede a sequential search of an array.
- Apply your method of search to the given array to locate the element of number 11.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- Apply your method of search to the given array to locate the element of number 13.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- What is the best-case runtime and the worst-case runtime of an array of size n?
Part II
Suppose you have the following array of data: {4, 5, 7, 11, 20, 24, 31, 35, 40, 45, 50}.
- Explain how you precede a binary search of an array.
- Apply your method of search to the given array to locate the element of number 11.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- Apply your method of search to the given array to locate the element of number 13.
- Clearly indicate whether or not the element was found and its index (location) within the array.
- What is the worst-case runtime of an array of size n?


This question has not been answered.
Create a free account to get help with this and any other question!

Brown University
1271 Tutors

California Institute of Technology
2131 Tutors

Carnegie Mellon University
982 Tutors

Columbia University
1256 Tutors

Dartmouth University
2113 Tutors

Emory University
2279 Tutors

Harvard University
599 Tutors

Massachusetts Institute of Technology
2319 Tutors

New York University
1645 Tutors

Notre Dam University
1911 Tutors

Oklahoma University
2122 Tutors

Pennsylvania State University
932 Tutors

Princeton University
1211 Tutors

Stanford University
983 Tutors

University of California
1282 Tutors

Oxford University
123 Tutors

Yale University
2325 Tutors