-
Notifications
You must be signed in to change notification settings - Fork 0
Divide and Conquer technique is used to work out different problems of varyying natures. Our problem at hand is to efficiently search an integer value from grid of size n x n, where n is any integer, using the principles of divide and conquer. The grid has both it's rows as well as columns sorted in ascending order.
License
HxnDev/Search-integer-in-a-Grid-using-Divide-and-Conquer
ErrorLooks like something went wrong!
About
Divide and Conquer technique is used to work out different problems of varyying natures. Our problem at hand is to efficiently search an integer value from grid of size n x n, where n is any integer, using the principles of divide and conquer. The grid has both it's rows as well as columns sorted in ascending order.
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published