Imagine you have a data set with 9,987 names. The data set is sorted alphabetically. You want to find out if the name "David Joy ner" is in the data set. Using a linear search, what is the minimum number of names we might have to check?
1 answer:
Answer:
1
Step-by-step explanation:
David Joyner might be the first name, so you may only have to check 1 name .
You might be interested in
C) stratified random sampling
The answer is 13.0 for the distance between Samantha and Mia after 1 hour.
Answer:
its c
Step-by-step explanation:
Answer:kado spent 1 2/3 hours painting a fence. Then he spent 4/5 of an hour walking the dog. How much longer did he spend painting than walking the dog
Step-by-step explanation:
Answer:
$76,518.88
Step-by-step explanation:
continuous interest
pe^(rt)
we have
59000e^(.026*10)
76518.88