15,925,505 members
Sign in
Sign in
Email
Password
Forgot your password?
Sign in with
home
articles
Browse Topics
>
Latest Articles
Top Articles
Posting/Update Guidelines
Article Help Forum
Submit an article or tip
Import GitHub Project
Import your Blog
quick answers
Q&A
Ask a Question
View Unanswered Questions
View All Questions
View C# questions
View C++ questions
View Javascript questions
View Visual Basic questions
View Python questions
discussions
forums
CodeProject.AI Server
All Message Boards...
Application Lifecycle
>
Running a Business
Sales / Marketing
Collaboration / Beta Testing
Work Issues
Design and Architecture
Artificial Intelligence
ASP.NET
JavaScript
Internet of Things
C / C++ / MFC
>
ATL / WTL / STL
Managed C++/CLI
C#
Free Tools
Objective-C and Swift
Database
Hardware & Devices
>
System Admin
Hosting and Servers
Java
Linux Programming
Python
.NET (Core and Framework)
Android
iOS
Mobile
WPF
Visual Basic
Web Development
Site Bugs / Suggestions
Spam and Abuse Watch
features
features
Competitions
News
The Insider Newsletter
The Daily Build Newsletter
Newsletter archive
Surveys
CodeProject Stuff
community
lounge
Who's Who
Most Valuable Professionals
The Lounge
The CodeProject Blog
Where I Am: Member Photos
The Insider News
The Weird & The Wonderful
help
?
What is 'CodeProject'?
General FAQ
Ask a Question
Bugs and Suggestions
Article Help Forum
About Us
Search within:
Articles
Quick Answers
Messages
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.
bowww
31-Jan-11 12:39pm
View
ok thanks :) I really appreciate your help :)
bowww
31-Jan-11 12:37pm
View
i understand it but I can never know how to get those equations. I tried so many different ones but never got to this one. If you could explain that would be great:) thanks a lot for your help
bowww
31-Jan-11 12:06pm
View
my series is 0,3,9,18,30 ...so 3X0=0,3X1=3,3X3=9, 3x6=18 adding to the previosu value 1,2,3,4,5,6
bowww
31-Jan-11 12:04pm
View
i get that it is the difference of 1st-2nd, 2nd-3rd, 3rd-4th, 4th-5th...but in order for me to make an equation for that I will only satisfy the first step .. im so confused.
bowww
31-Jan-11 11:59am
View
I know it is 0,3,9,18.. i just mistyped the 1.. i still don't get what you are doing here, i tried understanding your method but cant seem to get it :S
bowww
31-Jan-11 8:53am
View
I tried and I can't find a pattern that satisfies the second number 0,3,9,18,30,45... i Know it moves likes this ..3X1=3, adding 2 to the 1 ..3X3=9, adding 3 to the 3 gives you 3X6=18, adding 4 to the 6 gives u 3X10=30, adding 5 to the 10 3x15=45 ..my problem is that i cant find a general equation that satisfies all of the above.. i cant put it into an equation.
bowww
31-Jan-11 8:50am
View
ok I need to find a general equation that works for every value of k (0,1,2,3) and satisfies the pattern. as you can see the first Number increases by 1 the second number 1,3,9,18,30,45 is the part where i can't find an expression that satisfies it .. T(N-3),T(N-6),T(N-12)..increases by 3 each time.
Show More