Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
3. The following pseudocode searches a heap data structure that is already sorted. a. Describe what this pseudo-code does. b. What are the strengths of this pseudocode? c. What are the weaknesses of this pseudocode?

3. The following pseudocode searches a heap data structure that is already sorted. a. Describe what this pseudo-code does. b. What are the strengths of this pseudocode? c. What are the weaknesses of this pseudocode?

Computer Networking: A Top-Down Approach (7th Edition)
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
See similar textbooks
icon
Related questions
Question
function HeapSearch (A Array, low int, high int, key int) // return index mid :integer Begin If (low != high) { Mid = (floor(low+high)/2)); If key <= A[mid} { return HeapSearch(A, low, mid, key); } else { return HeapSearch(A, mid+1, high, key); } end if; else //low=high - Array is either size=1 or all same values { If (key = low) { return low; } else { return 0; // key_not_found end if; } end if; End
Transcribed Image Text:function HeapSearch (A Array, low int, high int, key int) // return index mid :integer Begin If (low != high) { Mid = (floor(low+high)/2)); If key <= A[mid} { return HeapSearch(A, low, mid, key); } else { return HeapSearch(A, mid+1, high, key); } end if; else //low=high - Array is either size=1 or all same values { If (key = low) { return low; } else { return 0; // key_not_found end if; } end if; End
3. The following pseudocode searches a heap data structure that is already sorted. a. Describe what this pseudo-code does. b. What are the strengths of this pseudocode? c. What are the weaknesses of this pseudocode?
Transcribed Image Text:3. The following pseudocode searches a heap data structure that is already sorted. a. Describe what this pseudo-code does. b. What are the strengths of this pseudocode? c. What are the weaknesses of this pseudocode?
Expert Solution
steps

Step by step

Solved in 2 steps

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS