GitHub / 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.
JSON API: http://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HxnDev%2FSearch-integer-in-a-Grid-using-Divide-and-Conquer
PURL: pkg:github/HxnDev/Search-integer-in-a-Grid-using-Divide-and-Conquer
Stars: 3
Forks: 0
Open issues: 0
License: mit
Language: C++
Size: 7.81 KB
Dependencies parsed at: Pending
Created at: about 4 years ago
Updated at: about 3 years ago
Pushed at: about 4 years ago
Last synced at: 3 months ago
Topics: algortihm, code, complexity, cpp, divide-and-conquer, grid, integer, search, time-complexity-analysis