- Upvotes Received
- 1
- Posts with Upvotes
- 1
- Upvoting Members
- 1
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
5 Posted Topics
Thanks for the lovely explanation Narue. I have a couple of questions though. I assume that when you said the complexity for the following code was O(N log (N)), you meant the average case measure? [code] void quicksort ( int list[], int left, int right ) { int pivot = …
I've been trying to get it to work but it just won't. For some reason everytime I run a program it freezes up my command prompt and I have to close it forcefully. Does anyone know a fix to this? One reason why I absolutely have to use this compiler …
Small question about javascript. From my understanding, whenever I view a webpage that requires a js file, the file is downloaded to the client computer and accessed from there. Are any checks performed while "using" the information in this js file? What's stopping me from changing this file on my …
The function is 6 * 2 ^ n + n ^ 2 From what I have read I need to find two constants c1 and c2 such that c1 g(n) <= f(n) <= c2 g(n) for all n >= n0. Would appreciate it if someone could explain how to find …
Can you explain a bit more please? I can't understand what you're trying to do.
The End.