let's suppose there are 1 million documents in a collection, each document need to have some tags corresponding to it, should i be storing these tags in the form or array or in the form of object having boolean values?…
I quickly wrote this code to test when all sides and diagonals of a cuboid a,b,c,d,e and f are all integers. It seems to work just fine but it takes way too much time for higher and higher values to…
Greetings fellow users and i hope your having a nice day. I have a doubt. Given an array of arbitrary numbers, i am looking to quickly [with time and space complexity lower than O(n²) at minimum, n = length of…
I have a function in my javascript code that loops through an array and performs some time-taking actions on each item of the array. It works fine for now when the number of items is low in the array but…
Let's say we have an arbitrary integer, position that equals 1850 We also have an array of integers, components that equals [150, 200, 500] We can reach the zero by: Subtract components[2] from position three times (500*3), making it 350…
I want to determine the time complexity of the below code 👇 function random(a){ let i; let num=Math.floor((Math.random()*(a+1))) return num; } function fuc1(n){ let i; if(n<=0){ alert("condition false ") return 0; }else{ i=random(n-1); console.log("thisn") return fuc1(i)+fuc1(n-1-i); } } fuc1(6) I…
I am wondering if the following MySql SELECT query takes O(N) or O(logN). Let us we have a table represents 4 integer intervals [startNum, endNum]. And the table is indexed by the startNum and endNum columns. startNum, endNum 3, 8…
Document says that "O(N) where N is the number of clients already subscribed to a channel" Does N means the number of clients who subscribing the channel which I want to unsubscribe, or who subscribing any channel?
I am studying informed search algorithms, and for Iterative Deepening A* Search, I know that the space complexity is O(d), where d is the depth of the shallowest goal node. I have tried to find out what its time complexity…
I am reading the book Artificial Intelligence: A Modern Approach. I came across this sentence describing the time complexity of uniform cost search: Uniform-cost search is guided by path costs rather than depths, so its complexity is not easily characterized…