ITEC 2620 Lecture Notes - Lecture 1: Binary Search Algorithm, Linear Search, Weighted Arithmetic Mean

41 views4 pages
Ambassador badge icon
22 Oct 2021
Course
Professor

Document Summary

Computer process data process data -> store data -> find data. A query for the existence and location of an element in a set of distinct elements. Elements have searchable keys associated with a stored record. > to find a record e. g. phone number. Location -> where are they in the phone book. > with these two you can now process the attached data. >isolate searching for keys -> some data type. Write a static method that determines the range (the difference between the largest and the smallest element) in a fully populated array of ints. Write a static method that determines the location (the array index) for a given value in a fully populated array of ints, return -1 if the value is not in the array. Can you always guess my number in 7 tries (range 1-100). Make your first guess in the middle of the range.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions