CS601 - Data Communication
Question(s) similar to the following:
Why binary search algorithm is more efficient than the linear search algorithm?
Question 1: Why binary search algorithm is more efficient than the linear search algorithm?
Answer: Suggest Edit
Binary search algorithm is more efficient than liner algorithm because the arrays are sorted in asending or desending order and we use "devide and conqrer" technique. In binary search each iteration reduces the search by the factor of two but in the linear we have the same number of searches as we have the number of elements.e.g,if we have array of 1000 elements the linear search will take 1000 iterations however binary search will take max 10. (page 118)
Similar Questions:
Question 2: Why binary search algorithm is more efficient than the linear search algorithm?
Answer: Suggest Edit
Binary search algorithm is more efficient than liner algorithm because the arrays are sorted in asending or desending order and we use "devide and conqrer" technique. In binary search each iteration reduces the search by the factor of two but in the linear we have the same number of searches as we have the number of elements.e.g,if we have array of 1000 elements the linear search will take 1000 iterations however binary search will take max 10. (page 118)
Past Papers of CS601 - Data Communication
Question 1: Why binary search algorithm is more efficient than the linear search algorithm?
Answer: Suggest Edit
Binary search algorithm is more efficient than liner algorithm because the arrays are sorted in asending or desending order and we use "devide and conqrer" technique. In binary search each iteration reduces the search by the factor of two but in the linear we have the same number of searches as we have the number of elements.e.g,if we have array of 1000 elements the linear search will take 1000 iterations however binary search will take max 10. (page 118)Similar Questions:
Question 2: Why binary search algorithm is more efficient than the linear search algorithm?
Answer: Suggest Edit
Binary search algorithm is more efficient than liner algorithm because the arrays are sorted in asending or desending order and we use "devide and conqrer" technique. In binary search each iteration reduces the search by the factor of two but in the linear we have the same number of searches as we have the number of elements.e.g,if we have array of 1000 elements the linear search will take 1000 iterations however binary search will take max 10. (page 118)Sponsored
Attach VULMS for better learning experience!
Our VULMS adds features of MDBs and lets your populate VU subjects automatically.
Tajweed Classes (Learn Quran with Tajweed)
Try our 3 days free demo now! Online online holy quran tajweed classes are useful to learn reading holy quran with tajweed.
Gegasoft POS/CRM Software
Gegasoft Point of Sale/Customer Relationship Management software is an accounting software to fulfill your business needs.
Sponsored
?