I really need help with RAPTOR Programming

timer Asked: Apr 6th, 2016

Question description

Can anyone help me solve problems using the Flow Chart Program "RAPTOR" ?

For the following Programming Challenges, use the modular approach and pseudocode to design a suitable program to solve it. Write a program to load an array, Squares, with 100 numbers. Each element should contain the square of its index value. In other words, Squares[0] = 0, Squares[3] = 9, Squares[8] = 64, and so on. Then prompt the user for a number from 0 through 1000 and write pseudocode to check if that number is a perfect square (i.e., if the user inputs X, check to see if X is a value in the array). Use a serial search for this program. Add pseudocode to check how many iterations must be made for each number entered by the user and, if you also complete Programming Challenge 7 in RAPTOR, you can compare the two values.
Change the Number of elements in the squares array to 500. Run both kinds of searches (Programming Challanges 6 and 7) Several times and keep track of how many iterations each program must make for each search. Does your data demonstrate that one algorithm is more efficient than the other? Justify your response

Tutor Answer

(Top Tutor) Studypool Tutor
School: New York University
Studypool has helped 1,244,100 students
flag Report DMCA
Similar Questions
Hot Questions
Related Tags
Study Guides

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