Rashakil Fol

I am wondering why it makes false claims on its front page.

I just realized that I forgot I had left some money in my Paypal account. I'm richer than I thought I was! Well, closer to achieving zero net worth, anyway...

What are you talking about? The time complexity is a mathematical expression describing the growth rate of an algorithm's running time as an input parameter varies. Running an algorithm 1000 times wouldn't give you any clue about the time complexity. yenh, I don't feel like writing out a tutorial every …

Be more specific about what you want to do.

Um, why don't you write it yourself?

See [url]http://en.wikipedia.org/wiki/IEEE_754[/url] for information on how float and double are typically implemented.

Reverse postorder means you traverse each node's children from right to left.

Life's too short to worry about operating systems.

Having buttons move around the window and stop in the middle, all in the way, is annoying.

See [url]http://www.daniweb.com/techtalkforums/post183580-17.html[/url] which might give you some idea of how to solve the problem.

So, what is the behavior of the function when the list is empty? Can you define the behavior of the function in relation to a function call on a list that is closer to being empty? The function is defined recursively; a recurrence relation is just another way of writing …

So, what is the problem? Why can't you do it? What do you think the answer is? Do you think you'll just get answers just by posting questions? We don't do people's homework here. If you need help, explain what ideas you might have about what the solution would be.

Dune, Snow Crash, and Surely You're Joking, Mr. Feynman!

It depends on how your tree is structured. Do leaf nodes contain pointers to their parents? Or is it that parents contain pointers to their children, and that you're only given the root node and the addresses of the two particular leaf nodes? In the former case, you can do …

You have interpreted the problem correctly. Your instructor is a complete idiot with a personality disorder. [QUOTE=madcapjack](a) Show that any algorithm that can decide whether a given array includes such an element, and if so find it must check all the elements in the array."[/quote] I would add and remove …

Then get good in programming.

Yeah, there's a simple and straightforward algorithm for this. The first step is to understand how to represent a linear system of equations with matrices and how to solve that with a computer program. Once you understand that, you'll need some way to be able to find all the roots …

I've never seen it before. But, you know, it has no advantage over Quicksort, unless it'd kill you to use the (log n)/(log 2) words of auxiliary memory needed for quicksort.

In some distributions you can, if you're on the AMD64, i.e. x86-64 architecture, since it's a superset of x86 -- there are issues that come up, like the fact that you need thirty-two-bit libraries /and/ sixty-four-bit libraries installed on the system.

And what do you need to know? Specifically, what gaps of knowledge prevent you from using the information at [url]http://en.wikipedia.org/wiki/Interpolation[/url] to figure this out?

Net neutrality is a silly notion [i]if[/i] it's easy to set up your own network and connect yours to others'. If that's the case, then competition will take care of problems and distribute access efficiently and fairly. By 'easy', I mean if there are loose local regulations regarding burying of …

If I were to consider VB.net, I'd end up using C# instead. Then again, C# isn't in the C family, except in a loose syntactic sense... but okay. Usually, you'll want to use a language with automatic memory management (i.e. garbage collection), which means you'll want to use VB, C#, …

Not only can you store larger numbers with doubles, the numbers are stored with more precision.

In UNIX-like systems, a file descriptor is a small integer associated with an open file stream. You can use procedures like read and write to read and write to a particular file stream, and in order to do this, you need to provide the file descriptor for the open file …

[quote]flag = (x <= 10) ? true : false[/quote] You could just write [inlinecode]flag = (x <= 10);[/inlinecode] And you're sorely mistaken if you think your post helped the original poster.

Tea. Earl Grey. Hot.

Make a program that takes a BF program (a simple programming language) as input and outputs how many steps it takes to run, without actually running the program.

Realize that if you have 128 binary digits, you won't be able to store that in a long or long long datatype.

That's because it's a hard question. It was on my DSA final. Because it's an O(log k) algorithm, you can bet that it involves jumping pointers around in a binary search-esque pattern. You might also want to try assuming that k <= n for now. (If k > n, you …

Um... what's your point?

Search the forum or the web for ideas -- there are zilliards of people who ask this question.

[QUOTE=Ancient Dragon]getch() returns an int, not a char. And there is an open parenthesis missing in the if condition. [code] [color=red]int c; [/color] [color=blue]if( (c==getchar())!='\n')[/color] <snip> [/code][/QUOTE] I don't see why two people assume that == is the desired operator between c and getchar(). For one, (c==getchar()) will never return …

Why, because you lied on your résumé about your abilities?

[b]Your Personality Profile[/b] [img]http://images.blogthings.com/worldsshortestpersonalitytest/black.jpg[/img] You're stupid, obsessive, and dimwitted. People avoid talking to you because you're so annoying. You live a shell of a life, ignorant of the world around you, too tired and insolent to improve your circumstances. While others socialize, you download porn off of Usenet. You waste …

What is a terrorist country, and how do you kill it?

Windows XP, Mac OS X, and Linux (Ubuntu).

[quote=yaeli_17]don't have any problems with calculus or math.[/quote] That's great news. [quote]but i'm ailttle bit concerned because i have no programming knowledge what-so-ever, and i mean zip.[/quote] That doesn't matter. You might surpass these students who have 'programming knowledge' quickly. What separates students in computer science programs isn't how much …

begin Why would anybody want to use Pascal? end; You'll see it in Delphi, anyway, and I'm sure other people still use it. It's unpopular because it is a restrictive language, compared to others.

You can make a mask representing what users are in each group: for example, for G1, that would be 10001, for G2, that would be 10101, and so on. Then combine these masks using regular bitwise operations.

The help file should have everything you need. And why (the hell) would you want to learn QBASIC next?

Wasn't there something sometime during one of your classes that interested you?

Also, if you're using C++, there's no reason you should be writing [inlinecode]typedef struct { ... } foo;[/inlinecode]. Just write [inlinecode]struct foo { ... };[/inlinecode].

[url]http://search.cpan.org/search?query=csv&mode=all[/url]

You need to be clear about where your output begins and ends. Your program prints out "This is from slp.pl\n\n"?

[QUOTE=WolfPack][tex]\lim_{N\to\infty}{N^2 \over 2} + {N \over 2} = N^2[/tex][/QUOTE] Don't use fake mathematics. For starters, N^2/2 is nowhere near N^2. And even if you wrote N^2/2, the distance away as N appoaches infinity would be infinity also. The reason the function is [tex]O(N^2)[/tex] is that, with [tex]N_0 = 5[/tex] and …

If you signed up for piano lessons, but then decided that you didn't feel like taking them, would you ask somebody to go in your place?

That code wouldn't work at all anyway; the values of m, a, b, and c never change. And it seems completely oblivious to triplets like 20,21,29.

What operating system are you using?

If all you have is an AK-47, everything looks like an enemy combatant.

What part do you need help on?