Problem Detail: How efficiently can a doubly linked list be sorted? The minimum I could get is $O(n^2)$. Can anyone suggest something better? Asked By : Rishika Answered By : FrankW Mergesort keeps its $Theta(nlog n)$ worst case on linked lists. Double-linking can’t Read More …
Category: Uncategorized
[Solved]: Artificial intelligence – bridge and torch problem
Problem Detail: I am doing a artificial intelligence course as part of my computer science degree. I am stuck on a question about searching. The question is a version of the Bridge and torch problem. Five people need to walk from Read More …
[Solved]: Prerequisites of computational complexity theory
Problem Detail: what’s the prerequisite topics needed for understanding computational complexity theory and analysis of algorithm …including big-O and Big-theta notations and these staff. I want a mathematical background and good book suggestions for each topic … thanks Asked By : Eng_Boody Read More …
[Solved]: Is every linear-time algorithm a streaming algorithm?
Problem Detail: Over at this question about inversion counting, I found a paper that proves a lower bound on space complexity for all (exact) streaming algorithms. I have claimed that this bound extends to all linear time algorithms. This is a Read More …
[Solved]: Why do most books say that a 1 bit branch predictor mispredicts on the first loop iteration?
Problem Detail: I am reading two books, Computer organization and design by David A Patterson, and Digital Design and Computer Architecture by Harris and Harris. These books claim that a 1 bit branch predictor mispredicts on the first and last iterations Read More …
[Solved]: Computing FOLLOW sets for a LL(1) grammar
Problem Detail: I am trying to learn compiler design. But I get confused when I have to deal with Follow set specifically for the empty word. I am trying to figure this out please help me with the same. S-> ABC Read More …
[Solved]: difference between propagation speed and bandwidth in digital communication
Problem Detail: I want to know difference between propagation speed and bandwidth in digital communication.I know bandwidth is no of bits in one second and propagation speed of signal is distance traveled by signal is one second.Is there any relation between Read More …
[Solved]: CLRS – Maxflow Augmented Flow Lemma 26.1 – don’t understand use of def. in proof
Problem Detail: In Cormen et. al., Introduction to Algorithms (3rd ed.), I don’t get a line in the proof of Lemma 26.1 which states that the augmented flow $fuparrow f’$ is a flow in $G$ and is s.t. $|fuparrow f’| =|f|+|f’|$ Read More …
[Solved]: Splay tree with odd number of rotations
Problem Detail: When inserting an item into a splay tree, rotations are performed in pairs based on either a zig-zag or zig-zig pattern. When there is an odd number of rotations to be performed, one could either do the extra rotation Read More …
[Solved]: Can partial sorting help with lookup cost in arrays?
Problem Detail: Looking something up in an unsorted list is a task with time complexity $O(n)$. However, if the list is sorted, the time complexity is $O(log(n))$. That means it is sometimes worthwhile to sort an array. However, that is a Read More …
