I tried the binary search on the 2D matrix and I got the solution which gives the time compexity to be the O(logN.logM). There exist already a solution which performs it in log(MN) time. I Only want to know which is better or less-time taking. Really a burning question.
Which time-complexity is better O(logM + logN) or O(logM.logN)?
763 views Asked by Mohit Ashliya At
1
There are 1 answers
Related Questions in ALGORITHM
- MCNP 6 - Doubts about cells
- Given partially sorted array of type x<y => first apperance of x comes before first of y, sort in average O(n)
- What is the algorithm behind math.gcd and why it is faster Euclidean algorithm?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- Dots and Boxes with apha-beta pruning
- What is the average and worst-case time complexity of my string searching algorithm?
- Building a School Schedule Generator
- TC problem 5-2:how to calculate the probability of the indicator random variable?
- LCA of a binary tree implemented in Python
- Identify the checksum algorithm
- Algorithm for finding a subset of nodes in a weighted connected graph such that the distance between any pair nodes are under a postive number?
- Creating an efficent and time-saving algorithm to find difference between greater than and lesser than combination
- Algorithm to find neighbours of point by distance with no repeats
- Asking code suggestions about data structure and algorithm
- Heap sort with multithreading
Related Questions in SEARCH
- How to create a regular expression to partition a string that terminates in either ": 45" or ",", without the ": "
- Hospital route finding ai project
- tryin to write a function that searches for SSN in a dict, and if that SSN is found, to retrieve all the data associated with that SSN
- How the search filter from search bar works in mern?
- Angular application loading weirdly when I add "/" at the end of URL
- Elastic python to extract last 1hr tracing
- How to detect if two sentences are simmilar, not in meaning, but in syllables/words?
- I need to have a look at all my private pine scripts and filter the scripts for certain words in TRADINGVIEW
- What is correct URL? {'quandl_error': {'code': 'QECx01', 'could not recognize URL: /api/v3/databases/WIKI/search. Please check URL and try again.'}
- Solr 9 punctuation issue
- Autocomplete search filter not working for dynamically added input fields in angular
- How to correct call API search request with debounce?
- Search in GDrive only the first 5 topics
- How do I use sp/pnp sp.search to find all Associated sites when querying a hub site Id
- How to apply custom analyzers on a field in Vespa schema
Related Questions in DATA-STRUCTURES
- Why is the runtime for this O(n)?
- Purpose of last 2 while loops in the merge algorithm of merge sort sorting technique
- What is the problem in my "sumAtBis" code?
- Asking code suggestions about data structure and algorithm
- What would be the most efficient way to store multiple sets of fixed arrays (std::vector)?
- About Suffix Trees features
- Getting wrong answer in Binary Search solution
- Are there techniques to mathematically compute the amount of searching in greedy graph searching?
- AVL tree Nth largest operation - How to have all my tests pass? JAVA
- Why does the map size change?
- Complexity in Union of disjointed sets with lists
- Hash collisions in Golang map resolving
- C++ ordered map optimized with index access
- How to sort this list of strings along with the strings and output the result as expected?
- Why deleting an element in a linkedlist costs O(1)
Related Questions in BINARY-SEARCH
- Binary Search Error while trying to search through list
- Getting wrong answer in Binary Search solution
- Typescript error: "./src/models/MenuModel").SortOrder' is not assignable to parameter of type 'number'.ts(2345) (property) MenuModel.order: SortOrder
- What is the time complexity of doing two binary searches on an array?
- Allocate books DSA problem - Why is storing answer necessary when books allocated to less students?
- Why won't my binary search work for numbers that are double digits?
- Binary Search Tree (BST) - array representations
- Binary search for closest number in array to target, according to K. (C language)
- Leetcode 875: Koko Eating Bananas
- RunTime error in one testcase in Kth element of two sorted arrays
- Why isn't the code reflecting the actual mathematical behaviour when doing a binary search guess?
- Why incorrect answer for the Painter's partition problem when input is very large?
- Find the number of Kth-descendants of vertex v in tree
- Continuous Binary Search over Metric Space
- Amortised complexity of an operation on std::map data-structure
Related Questions in ARRAY-ALGORITHMS
- The delete do not work in deleteHeap in python
- online judge problems program c++
- Indexing an n-dimensional array stored as a 1d array
- Diff an array of objects so that it matches another without recreating any valid objects
- Real world return minimum value
- I wrote a function in C language that as I would think has O(n^3) time complexity, but as n grows, for some reason it behaves like O(n^2)
- Recursion method is invoked even after loop condition is met
- Iteration failure in radixsort aka bucket sort algorithm,Radix sort inefficient because it assigns wrong size for bucket 0 according to the unit test
- Maximum sum of two elements
- Is the time complexity of the code snippet less than O(n^2)?
- Inserting elements in a specific positions in the existing array
- How to sort an array according to set bits
- trying to adjust addition function to a subtraction function
- inaccurate results with function to add an array of digits together
- Efficient way of approaching the Subset Sum Problem with very large input sets
Popular Questions
- How do I undo the most recent local commits in Git?
- How can I remove a specific item from an array in JavaScript?
- How do I delete a Git branch locally and remotely?
- Find all files containing a specific text (string) on Linux?
- How do I revert a Git repository to a previous commit?
- How do I create an HTML button that acts like a link?
- How do I check out a remote Git branch?
- How do I force "git pull" to overwrite local files?
- How do I list all files of a directory?
- How to check whether a string contains a substring in JavaScript?
- How do I redirect to another webpage?
- How can I iterate over rows in a Pandas DataFrame?
- How do I convert a String to an int in Java?
- Does Python have a string 'contains' substring method?
- How do I check if a string contains a specific word?
Trending Questions
- UIImageView Frame Doesn't Reflect Constraints
- Is it possible to use adb commands to click on a view by finding its ID?
- How to create a new web character symbol recognizable by html/javascript?
- Why isn't my CSS3 animation smooth in Google Chrome (but very smooth on other browsers)?
- Heap Gives Page Fault
- Connect ffmpeg to Visual Studio 2008
- Both Object- and ValueAnimator jumps when Duration is set above API LvL 24
- How to avoid default initialization of objects in std::vector?
- second argument of the command line arguments in a format other than char** argv or char* argv[]
- How to improve efficiency of algorithm which generates next lexicographic permutation?
- Navigating to the another actvity app getting crash in android
- How to read the particular message format in android and store in sqlite database?
- Resetting inventory status after order is cancelled
- Efficiently compute powers of X in SSE/AVX
- Insert into an external database using ajax and php : POST 500 (Internal Server Error)
Well the question is some what ambigous. If you want to ask if
O(logM+logN) > O(logM*logN)then the answer is no,O(logM+logN)is always less thanO(logM*logN). In the body of the question you say that your complexity isO(logN*logM)and the complexity of a known algorithm isO(log(MN)). SinceO(log(MN)) = O(log(M)+log(N))we can say thatO(log(M)*log(N)) > O(log(MN))