How is algorithm and datastructure madeeasy book by narasimha for gate?
Answers
Answered by
0
Explanation:
In the book it is given that by Master's theorem it will be O(nlogn), but by masters it should be O(n)...but if we see the code then it looks like nlogn is the correct answer
Answered by
1
Answer:
☑ Data Structures and Algorithms for Gate (English, Paperback, Karumanchi Narasimha) The book provides detailed solutions for data structure and algorithm related questions in previous years GATE Papers. Algorithms and data structures are fundamental concepts in computer science, programming and related courses.
Similar questions