Problem Detail: I am studying these sorts, but it is still unclear to me which one of these two would require fixed length keys? Asked By : user2461994 Answered By : hanugm MSD(Most Significant Digit) radix sort needs fixed length keys as input. Read More …
Author: ignougroup
Simplify complexity of n multichoose k
Problem Detail: Edit: In my case, $k$ may be greater than $n$ and they grow independently. I have a recursive algorithm with time complexity equivalent to choosing k elements from n with repetition, and I was wondering whether I could get Read More …
Existence of bipartite perfect matching
Problem Detail: Let $B = G(L, R, E)$ be a bipartite graph. I want to find out whether this graph has a perfect matching. One way to test whether this graph has a perfect matching is Hall’s Marriage Theorem, but it Read More …
Lower bounds: queues that return their min elements in $O(1)$ time
Problem Detail: First, consider this simple problem — design a data structure of comparable elements that behaves just like a stack (in particular, push(), pop() and top() take constant time), but can also return its min value in $O(1)$ time, without Read More …
NFA to DFA convertion explanation
Problem Detail: I’ve converted this NFA to a DFA and I get a similar soultion automata but I’m not sure if I really understand everything. Please correct me if I’m explaining it wrong, I would love some feedback. From the state Read More …
What are the possible sets of word lengths in a regular language?
Problem Detail: Given a language $L$, define the length set of $L$ as the set of lengths of words in $L$: $$mathrm{LS}(L) = {|u| mid u in L }$$ Which sets of integers can be the length set of a regular Read More …
Matrix Chain Multiplication Greedy Approach
Problem Detail: In the question Matrix Chain Multiplication you are given a chain of Matrices and is required to find the optimal way to multiply the matrices together. Normally this is solved using Dynamic Programming but I have found a greedy Read More …
Find an MST in a graph with edge weights from {1,2}
Problem Detail: I’ve been asked the following question: Given a connected undirected graph $G=(V,E)$ and a weight function $w: E to {1,2}$, suggest an efficient algorithm that finds an MST of the graph. After a few clarifications, the algorithm should run Read More …
Decidable non-context-sensitive languages
Problem Detail: It is arguable that most languages created to describe everyday problems are context-sensitives. In the other hand, it is possible and not hard to find some languages that are not recursive or even not recursively-enumerable. Between these two types Read More …
Recursive equation for complexity: T(n) = log(n) * T(log(n)) + n
Problem Detail: For analyzing the running time of an algorithm , I’m stuck with this recursive equation : $$ T(n) = log(n) cdot T(log n) + n $$ Obviously this can’t be handled with the use of the Master Theorem, so Read More …
