thoughtcoder

[QUOTE=gretty;844034] -- if n is greater than 1, count how many times the expression is performed. - [B]Not working at all [/B][/QUOTE] co is being incremented just fine.

Wouldn't this advice depend on your location? Reveal that information to us. I'm guessing by your hair color and sun-exposure level that you're Canadian or Alaskan. Edit: on the other hand, the lipstick makes me think you must be some kind of english dandy.

The same way you normally stop scanning bar codes?

Don't get an A+ certification unless you're going to use it somehow between the time you get it and the time you get your bachelors in computer science. It is supposedly trivially easy to get, so don't spend any money on a course.

How are you calling this functions?

You people are so sexually repressed. There's nothing so cathartic as seeing a well-animated tentacle monster trapping a 12-year-old virgin in a library and challenging her to a Boggle contest, where the winner gets tickets to the next Jonas Brothers concert.

Computer Science books: Numerical Methods for Scientists and Engineers (Hamming), Approximation Algorithms (Vazirani), Types and Programming Languages (Pierce), Advanced Types and Programming Languages (Pierce), Computer Systems: A Programmer's Persective, Computational Science & Engineering (Strang), Data Structures and Algorithms in C++ (Goodrich, ...), Modern Operating Systems (Tanenbaum), Purely Functional Datastructures (Okasaki), …

Is your array sorted? Binary search only works when the array is sorted. The contents of "File.TXT" would have to be sorted for it to work.

Your ideas are stupid. They would be too expensive. You value your ideas too highly.

For algorithms that directly require modular arithmetic, such as some encryption algorithms. For writing log messages every Nth time through a loop. The "do something every Nth time through a loop" problem is probably where you'll see the modulus operator used most often.

That's a pretty weird error. What are you using to build and run things?

That is a problem, yes. That's why public keys are cryptographically signed (look this term up) by third parties. For example, the 'certificates' that websites using https have are signed by Verisign and other organizations that browsers know about. Suppose you're friends with Ken and Ken's friends with John. Since …

His problem is just that he needs to think more about the problem, maybe with some sleep in between.

Not much, the usual intelligence level it seems, maybe you should join multiple forums; maybe a socket question will come up in one of them. Do some RSSing and scraping and you can have a nice socket-related feed.

Well... when do you want it to terminate?

I would post my "marks", but they are all links to movies involving large groups of black men fornicating with one white female midget, and serious geeks like you wouldn't be interested.

Wow, the folks here really love replying to a dead thread. Edit: me too.

First you say you have a sequence of chars, but then you say you have a matrix of chars. Which is it?

You can read about XPath on the web. Places like Wikipedia's article on XPath 1.0 are a good place to start.

You could just look at the APIs and see for yourself.

Oh.

You're missing parentheses around [icode]removeOne ([x],n)[/icode]. Even then I'm not sure if that'll give what you want, but that's the cause of your current error -- the compiler thinks you're trying to pass too many arguments to createTree.

Use reads. [code] > reads " 234 blah" :: [(Integer, String)] [(234," blah")] > reads "blah" :: [(Integer, String)] [] [/code] It returns a list of the different ways the desired thing can be parsed. For all standard types, this list is of length 1 or 0.

I'm pretty sure the only way is to define an implicit conversion operator: [url]http://msdn.microsoft.com/en-us/library/z5z9kes2.aspx[/url] Of course, it should be stressed: "Use it to enable implicit conversions between a user-defined type and another type, [i]if the conversion is guaranteed not to cause a loss of data.[/i]" In fact, I think you …

Um, yes, it is a hash. Is hash not a synonym of checksum?

What. What do you want. Do you want this problem solved? Maybe you should solve it, then.

Make an online chatroom.

MFC is used in MS Word? How do you know? How do you know its developers use VC++?

Not really.

There's no way to find the answer: you do not have enough information. You only have 2N bits of information, where N is the size of the integer types involved, measured in bits. It takes 3N bits to describe the values of a, b, and c.

There is pseudocode in the Wikipedia article.

C++ doesn't have automatic memory management, which is a very big deal. This means it takes a lot of knowledge to use the language efficiently. The language might be tolerable to people who have this knowledge, but not to those who lack it.

You don't need permission for the "brief passage" exception. She should just ask for permission, it's not like brief snippets of code are particularly valuable and it's not likely they'll deny it.

Yeah, it's really hard to understand why you wouldn't already be able to tell whether your solution was right.