Print

Please login or register.
1 Hour 1 Day 1 Week 1 Month Forever
Login with username, password and session length

[kaenneth]

A header file that #defines a string you use as a variable name?

[dizzyelk]

I'm using MS Visual C++ 2010 Express.

[Yannanth]

.

[alway]

What programming languages do I need to know?

http://www.w3schools.com/
http://www.w3schools.com/html5/default.asp in particular.
Anything related to html or web development, w3schools can at the very least point you in the right direction. What particular bits of it you use depends on what you are making, but that should at least get you started.

[Nadaka]

I want to develop and HTML5 game that can hopefully be ported to Android and iOS tablets as well (I think Windows Phone accepts HTML5 apps too). What technologies do I need to use? What programming languages do I need to know? Tell me everything. I will pay in gratitude.

You need to know javascript mostly. but also html and css, because it is a lot easier to build a ui with html than it is to paint it into a canvas. You also need to download and install every browser known to man and learn the horror of almost but not quite entirely dis-similarly glitching code that usually somewhat works... mostly.

[SolarShado]

Non-trivial, cross-browser javascript has historically been deep magic...

In my (admittedly limited) experience though, IE9 and the latest chrom(e/ium) are pretty on par with each other.

[Siquo]

That's what mootools&jquery are for. Wrap the magic in a box called $.

[Twiggie]

so I had an interview this morning, and the last question was this:
given two files of userIDs, find all the records that exist in both files. the original files are too large to fit in primary memory.

i said sort them in secondary memory and then iterate down them, but i didnt know any external sorting algorithms so they asked me to find another solution.

what do?

and no, the naive solution doesnt count.

[Siquo]

Hope for some kind of equal distribution, and separate them first into batches (so while streaming over the initial lists, sort them into batches of 0-1000, 1001-2000 etc depending on min/max numbers), then compare per batch?

[Twiggie]

isnt that essentially an external bucket sort?

they definitely hinted that there was a solution that didnt involve sorting, but i have no clue what it is

[Siquo]

If they know an answer that does not involve any sort of sort, I'd want to hear it as well...

I had to look up bucket sort, but that involves sorting the buckets. Technically once you've bucketed the stuff, two equal-range buckets fit in RAM (if you chose your buckets right), and you wouldn't have to sort the buckets themselves, so that wouldn't count, would it?

[Twiggie]

well no you wouldnt have to, but its more efficient to sort the buckets in RAM, since the naive approach with two buckets takes O(n^2), but sorting them takes O(nlogn + n) = O(nlogn).

[Siquo]

I didn't say it was super-effective I can't think of any other non-sorting matching, though... But I'd like to see if anyone else can?

[Mini]

You *could* just loop through the first list, and for every item in it loop through the second and check for matches. If you wanted it to be less hilariously inefficient you could load chunks of data at a time for checking. It would still probably end up being reasonably hilariously inefficient, however.

[alway]

You could utilize key-value pairs with hash tables.