Assuming you are using binary search to determine if the number 68 is in the fol

Question

Assuming you are using binary search to determine if the number 68 is in the following list of numbers: 11 13 19 23 32 35 41 47 60 68 70 73 81 84 99?

What values would you examine?

Answer should be 3 numbers:

such as -----fill in blanks-------- | ------fill in blanks------------------- | ----fill in blanks------ Assume

you are using bubble sort to place the following array in ascending order.

Show the content of the array after each pass of the algorithm?

initial values: 21 19 17 2 16 15 7

pass 1: 2 21 19 17 7 16 15

pass 2: 7 blanks

pass3: 7 blanks

pass4: 7 blanks number

pass 5: 7 blanks

pass 6: 2 7 15 16 17 19 21

what should the missing pass 2, 3, 4, 5 be?

Explanation / Answer

Let array A[]={11,13,19,23,32,35,41,47,60,68,70,73,81,84,99} So A[0]=11 A[14]=99. Algorithm:- first = 0; last = n - 1; middle = (first+last)/2; while( first

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.