Rashakil

Hello all, I had to write a program that would take a list and check for alternate atoms and list, if there were two atoms in a row, it would #f, same for two lists. I now need to make it #f for 3 in a row. This is what …

I am working inside a function and am already passing back a value. Inside the function I am using cin to get an int from the user. If they want to quit they type q. The input buffer fails when this happens. I could use an if statement and then …

[B]I found a political test online. I have no idea how accurate it is, but it's fun to take so go ahead and see what it says you are. The link is [URL]http://www.okcupid.com/politics[/URL] [/B] [B]Your true political self:[/B] You are a [B]Social Liberal[/B] [COLOR=green](83% permissive)[/COLOR] and an... [B]Economic Liberal[/B] [COLOR=green](10% …

I was just wondering if anyone thinks that it might be a problem finding the New Thread button? Is it too small? Not noticable enough?

Hi, I admit i'm a complete newbie in perl although i have been invloved in php : ) hope somebody can help me out with this I want to run a simple perl scrip : [CODE]#!/usr/bin/perl print "Content-type: text/html\n\n"; $request_method=$ENV{'REQUEST_METHOD'}; print "request method:",$request_method,"<br>"; print "O.K.!";[/CODE] but it shows this error …

Hello!! Could anyone please tell me how to formulate the basic running time T(n) equation in an algo with involves recursive calls. For example for merge sort we have: T(n)=2T(n/2)+D+C(n) What do we exactly need to note to form such an eqn?!? Thanks!!