Click here to Skip to main content
15,925,505 members

Comments by bowww (Top 12 by date)

bowww 4-Mar-11 16:30pm View    
I just saw the reply now ... I figured that out later..thanks for the help :D:D
bowww 4-Mar-11 9:24am View    
yes but the test cases are:

q.insertFirst(120);
q.insertFirst(15);
q.printDeque();
System.out.println("first=" + q.getFirst());
System.out.println("last=" + q.getLast());

so there should be something in the deque..
bowww 2-Feb-11 12:20pm View    
Well this is a course called data structures and algorithms in java and this question is an assignment question. The course is very difficult and confusing that's why im seeking help.
thanks
bowww 2-Feb-11 3:35am View    
no i need to show that log^kN is o(N) (small o) for any constant k..
bowww 1-Feb-11 23:47pm View    
no it's data structures and algorithms i just need to prove that log^kN is small o of (N) using L'Hospital's rule.