https://github.com/hxndev/search-integer-in-a-grid-using-divide-and-conquer
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.
https://github.com/hxndev/search-integer-in-a-grid-using-divide-and-conquer
algortihm code complexity cpp divide-and-conquer grid integer search time-complexity-analysis
Last synced: 3 months ago
JSON representation
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.
- Host: GitHub
- URL: https://github.com/hxndev/search-integer-in-a-grid-using-divide-and-conquer
- Owner: HxnDev
- License: mit
- Created: 2021-06-11T03:49:52.000Z (about 4 years ago)
- Default Branch: main
- Last Pushed: 2021-06-11T04:05:35.000Z (about 4 years ago)
- Last Synced: 2023-03-04T18:38:11.645Z (over 2 years ago)
- Topics: algortihm, code, complexity, cpp, divide-and-conquer, grid, integer, search, time-complexity-analysis
- Language: C++
- Homepage:
- Size: 7.81 KB
- Stars: 3
- Watchers: 1
- Forks: 0
- Open Issues: 0