0 votes 0 votes Which algorithm has same average, worst case and best case time ? Binary search Maximum of n number Quick sort Fibonacci search Algorithms algorithms time-complexity + – Sanjay Sharma asked Jun 8, 2016 • edited Jun 26, 2022 by makhdoom ghaya Sanjay Sharma 4.9k views answer comment Share Follow See 1 comment See all 1 1 comment reply asu commented Jun 9, 2016 reply Follow Share B ? 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes B ....as maximum of n number is O(n) for all cases debanjan sarkar answered Jun 9, 2016 debanjan sarkar comment Share Follow See all 2 Comments See all 2 2 Comments reply asu commented Jun 9, 2016 reply Follow Share CAN U GIVE REFERENCE FOR FIBO.SEARCH 0 votes 0 votes debanjan sarkar commented Jun 9, 2016 reply Follow Share http://www.geeksforgeeks.org/fibonacci-search/ 0 votes 0 votes Please log in or register to add a comment.