What is normalization with advantages and disadvantages?
Answers
Answered by
0
Hlo Buddy!!
@nsWeR ➡ Speed/Time. Suppose you have a sorted list of 1 million items. Using sequential search to search for an item in the list will on average examine about half the items in the list which is 500,000 in this instance. Using binary search to search for an item in the list will examine about log base 2 of the number of items in the list which is 20 in this instance. Examining only 20 items is a lot more efficient than examining 500,000. So if the list is sorted, prefer binary search over sequential search (unless the list length is extremely small).
#ThAnKYou___♥
MaRk Me as Brilliant...
@nsWeR ➡ Speed/Time. Suppose you have a sorted list of 1 million items. Using sequential search to search for an item in the list will on average examine about half the items in the list which is 500,000 in this instance. Using binary search to search for an item in the list will examine about log base 2 of the number of items in the list which is 20 in this instance. Examining only 20 items is a lot more efficient than examining 500,000. So if the list is sorted, prefer binary search over sequential search (unless the list length is extremely small).
#ThAnKYou___♥
MaRk Me as Brilliant...
Answered by
0
speed× Time here is your answer
Similar questions
English,
7 months ago
Math,
7 months ago
Science,
7 months ago
Computer Science,
1 year ago
Computer Science,
1 year ago