Introduction to Evaluation of Algorithms

Question 1

which is more efficient for searching brute force linear search or binary search

Answer 1

binary search

Question 2

best case scenario loop iterations of linear search

Answer 2

1

the number we are searching for is the first number in the array

Question 3

worst case scenario loop iterations for linear search

Answer 3

array length

number we are searching for is the last number in the array or is not in the array at all

Question 4

worst case scenario loop iterations for binary search

Answer 4

logN

the number we are searching for isnt found until there is only one number left

Question 5

best case scenario loop iterations for binary search

Answer 5

1

the number we are searching for is directly in the middle of the array

Question 6

two methods for calculating order of growth

Answer 6

scientific method (experimental approach)

cost models (mathematical approach)

Question 6

two methods for calculating order of growth

Answer 6

scientific method (experimental approach)

cost models (mathematical approach)

Question 7

what are the system independent effects on run time

Answer 7

algorithm

input size

Question 8

What are the system dependent effects on run times

Answer 8

hardware (cpu, memory, cache)
software (compiler, interpreter, garbage collector)
system (operating system, network)