Algorithm New Question

Solution to T(n) = 2T(n/2) + log n
So my recursive equation is T(n) = 2T(n/2) + log nI used the master theorem and I find that a = 2, b =2 and d = 1.which is case 2. So the solution should be O(n^1 log n) which is O(n log n)I looked ...... 
Minimum Spanning Tree of Max Cost Complexity Class
"Decide whether a given undirected graph G=(V,E) with positive edge costs has a minimum spanning tree of cost at most K".Is this a problem of P, NP, CoNP, RP or BPP? I am fair sure that it ...... 
worst case runtime for ifelse recurrence
The question is asking worstcase time complexity of g(n), I'm confused about why the second equation is c1n, not c1n^2.I think the worstcase should have larger complexity right? Or it's because the ...... 
Algorithm is linear (O(n)) to size of input, but w
The instructor said that the complexity of an algorithm is typically measured with respect to its input size.So, when we say an algorithm is linear, then even if you give it an input size of 2^n (say ...... 
3 approximation algorithm(randomised or determinis
Let 3 colorful sets problem. Given M sets of size three over {1...n} elements. We are given in other words sets S1, S2, ... , Sm where, for every i, Si = {x, y, z} for some x, y, z ∈ {1, ... , n}. ...... 
What kind of algorithms have a runtime complexity
Are there any algorithms with a complexity of sqrt(2^n) ? Could you give any examples (if possible a very short one) ?... 
Prove that n=o(2^{f(n)})?
Please Note: In this question log (n) is to the base of 2.I know that f(n)=omega(log(n))  in other words for every c>0: f(n)>=c*log(n)(starting from a specific location)I want to prove that ...... 
Specific Graph and need to more Creative solution
Directed Graph (V=a, E=b) is given.each vertexes has specific weight. we want for each vertex (1..a) find a vertex with maximum weight that can be reachable from that vertex.Update 1: one nice ...... 
Exact Mathematical Definition of Average Complexit
Now I'm from a mathematical background, and I found CS people's definition of average time complexity a bit... confusing, to say the least.Here is a definition that I feel comfortable with:Consider ...... 
Calculating complexity of logarithm
As known the complexity to insert a node into AVL tree is log(c) when c is the number of nodes inside the tree.I'm looking to insert m nodes into the tree so the complexity is:log(c)+log(c+1)+...+...... 
Time complexity which is related to both count of
I have an algorithm where I have multiple tasks and for every task I have to execute as many actions as is the task length in minutes. The action cost is O(1). Is this pseudopolynomial, polynomial or ...... 
How to show “if operator in for operator&rdq
For Example:for (i = 0; i < 100; i++){ if (i % 3 == 0){ cout << i; }}How to show this code in codeblock algortihms?... 
Most likely topological order given distance matri
Given:a distance matrix (n x n) between n discrete points in 3D space ( eg. n = 5 // points = [x_a, x_b, x_c, x_d, x_e])the expected interval d_ij between adjacent points (d_23 = dist(a_2  a_3))...... 
Haskell Permute Function
This is my first question on this site. So if I am rude or not formal enough, I am sorry already.In my discrete math class professor showed us this permute functionpermute :: [a] > [[a]]permute ...... 
Maximize minimum distance between arrays
Lets say that you are given n sorted arrays of numbers and you need to pick one number from each array such that the minimum distance between the n chosen elements is maximized.Example:arrays:[0, ......