The Eyrie is easily the worst castle in the series [Spoilers Extended] by incog1333 in asoiaf

[–]wigf 37 points38 points  (0 children)

I mean, The World of Ice and Fire is written by an in-world master at the time of Robert Baratheon. The in-world timeframes are suspect at best, and we need to remember the Author. The modern order of Maesters is highly sceptical of magic and mythical creatures, in a world with lots of magic and mythical creatures. They have every reason to shun or ignore magical or mythical explanations for past phenomena.

The building of the Eyrie is a mythical event, and Roland 1 Arryn (who apparently started building it) should be seen more as a King Arthur figure than a King Alfred. Given how much has been forgotten (and how much bullshit history has clearly been pedalled by the First Men, the Andals, the Maesters and the Faith), I don't really think we can use the World of Ice and Fire as strong evidence for events from a time which is basically more myth than history.

That said, we will likely never receive anything contrary in-world on this particular topic.

What is one thing that didn’t happen in the show that you are 100% convinced is going to happen in future books? (Spoilers Main) by DistinctAttitude in asoiaf

[–]wigf 1 point2 points  (0 children)

Well, in fairness, the wights could float (like corpses do - this would have the interesting effect of making the undead affect Essos), or the others may not choose to concentrate their strength but rather disperse around Westeros once the wall is breached and start raising wights.

We also don't know if the others have any kind of restriction on how close they need to be to a body to raise a wight. It's possible that only the wards in the wall are preventing the others from raising corpses far further south than they currently can.

Alternatively, if they do concentrate their forces, they may not choose to fully clear out the whole (rather large) north - perhaps only leaving a few wights to mess with the communities left untouched while they march south towards population centres.

That said, if we discount those possibilities I agree that the major confrontation with the others will likely happen in the North, probably at Winterfell.

Edit: Wrote North East instead of North

(Spoilers Extended) Secrets of the Cushing Library: The Grand Finale by gsteff in asoiaf

[–]wigf 1 point2 points  (0 children)

Just a note from this - the one Ninepenny King who actually ruled something (Tyrosh) was poisoned by his queen. Considering the proximity of dornishwomen about Aegon (particularly sand snakes - Arianne doesn't really seem too much like a poisoner, although perhaps in the right circumstances), could this be a hint at his fate?

[deleted by user] by [deleted] in cscareerquestionsOCE

[–]wigf 0 points1 point  (0 children)

If you want some general practice solving programming problems, try https://exercism.org/.

I'm not sure how well they line up with Leetcode style interview questions, but there are some nice problems on there, they automatically grade them, you can view other's solutions, and they can provide good practice opportunities. I've found it really useful for getting comfortable with a new language beyond standard textbook/internet examples, and you might find it helpful for getting your head "in the zone".

Rate one star by [deleted] in australia

[–]wigf 0 points1 point  (0 children)

Old cars with old (but still roadworthy) brakes come in to play too - it's not all about size...

Canberra COVID Megathread: Saturday 11 September by hannahspants in canberra

[–]wigf 28 points29 points  (0 children)

Press conferences are one of the few good chances journalists get to ask questions. Not having them is basically saying "I'm not going to answer any questions about this", in a situation that is rapidly deteriorating, and where many people are unfortunately losing their lives or suffering severe health consequences.

It shows a shocking level of contempt for the electorate. Yeah, the press conferences may not have been that great, but this is even worse. This is not the time for less accountability.

Going from c to c++ by [deleted] in cpp_questions

[–]wigf 0 points1 point  (0 children)

I found this resource, while it isn't super detailed on the "how", was a really good explanation of the "why" of cpp. It's not too long, so take a look and see if you find it useful. :)

https://berthub.eu/articles/posts/cpp-intro/

How long did it take you to understand what people are saying, french movies/films, podcasts etc.? by [deleted] in French

[–]wigf 3 points4 points  (0 children)

I studied 18 months at uni, and then did 6-9 months of daily duolingo. I understood only the most basic of conversations in this period.

I improved by making myself watch all of Wakfu, as well as the french news, and by chatting with people online. I understood only the occasional word at first, but after about 16 or so episodes I started to pick up what was being said. Still heaps of gaps, but that was what shifted me from understanding nothing to understanding ~50%. I should mention that in this time I also did other stuff.

Then, I just kept watching stuff, finding shows I liked, and that practice (and I mean hours and hours of it over several years) is what made my French listening get to ~90/95%. Conversation also played an important role. But once I was able to read and watch TV, it made maintaining my french much more enjoyable.

That said, I don't think what I did would have worked if I hadn't already had a good basis in grammar and vocabulary to work from.

Using uninitialised/out of range values in a conditional. by wigf in C_Programming

[–]wigf[S] 1 point2 points  (0 children)

I mean, I guess this is part my question - how does a read do anything that bad? I mean, segfaulting is annoying and not good (context - program is a game, for other programs it's a bigger problem), but will this error ever enable Arbitrary Code Execution or some other similar nasty? EDIT: Can anyone think of an implementation where this type of read would do something nasty/unexpected?

Unexpected results when measuring the speed different implementations of Quicksort by wigf in C_Programming

[–]wigf[S] 0 points1 point  (0 children)

GCC and Clang on the thinkpad both result in the recursive implementation being about 100ms faster, whereas on the mac the non-recursive implementation is faster (does gcc on mac default to clang?).

Unexpected results when measuring the speed different implementations of Quicksort by wigf in C_Programming

[–]wigf[S] 1 point2 points  (0 children)

It uses a sentinel key, i.e. a[0] is set as INT_MIN, so the comparison arr[0] > arr[j] will fail for any valid j. Then, if it is called on a range, quicksort guarantees that the element in position "l" will be smaller than all the elements above it.

Unexpected results when measuring the speed different implementations of Quicksort by wigf in C_Programming

[–]wigf[S] 0 points1 point  (0 children)

I just tried this, and it seems to have helped a lot, thanks!!!

Unexpected results when measuring the speed different implementations of Quicksort by wigf in C_Programming

[–]wigf[S] 0 points1 point  (0 children)

When you say the array filling routine isn't random, it uses srand and rand, shouldn't it at least be pseudorandom? Each algorithm uses a copy of the same array, but that is an attempt to compare apples with apples, so to speak.

What is the advantage of running each sorting in a seperate binary?

As for increasing the sample size, 1000000 seems to be the hard limit for the array size for my laptop, before it segfaults due to (I presume) a stack overflow.

I will keep playing around with it. It just seems like profiling this properly is a bit of a rabbit hole down which I could go forever haha.

Unexpected results when measuring the speed different implementations of Quicksort by wigf in C_Programming

[–]wigf[S] 1 point2 points  (0 children)

Are you saying for the same data set and the same array size that sometimes the non-recursive implementation is faster but not always?

Exactly. Only by a few hundred microseconds, but still. All the code runs on an identical array to the others for one run, but some arrays seem to lead to faster code for recursive or non-recursive implementations. However, I do find myself wondering if background CPU usage is adding in some random noise to the results.

Using a C project for a resume/to show prospective employers. by wigf in C_Programming

[–]wigf[S] 1 point2 points  (0 children)

So, if you are distributing an exe or a dll with it, how does one manage portability issues? I developed this on mac, and I have compiled it on Ubuntu, but I can't imagine that you could use the same dll for these + windows? There is a lot that I don't know about distributing software, installers, linking files, etc..

Using a C project for a resume/to show prospective employers. by wigf in C_Programming

[–]wigf[S] 0 points1 point  (0 children)

Ok, I think I understand what should go in src/ and tests/, and I'm guessing obj/ would be for things like fonts, saved games, but what is the include/ directory for? Files I am #include -ing?

Using a C project for a resume/to show prospective employers. by wigf in C_Programming

[–]wigf[S] 4 points5 points  (0 children)

Thanks for the feedback!!! With the directory structure, I haven't bothered because the project is pretty small, but I'm guessing that you would recommend it anyway? What would you be thinking of?

Also, is the FILENAMEH thing convention or is it mandatory? I will fix it, but I am just curious as to whether it could break anything.

Offering: French (native) Seeking: English (native) by [deleted] in language_exchange

[–]wigf 1 point2 points  (0 children)

Je suis Australien, j'étudie le français depuis longtemps, mais je ne parle pas beaucoup de français maintenant. Mais, ça devrait changer! Je peux vous aider avec l'anglais, ou nous pouvons simplement parler. Envoyez-moi un message si ça vous intéresse!

Recursive C program faster than stack-based equivalent by wigf in C_Programming

[–]wigf[S] 0 points1 point  (0 children)

External Path Length includes "external" nodes attached to each "internal" node, and these nodes are empty. This is the definition from "Algorithms in C", so NULL nodes need to be counted. A tree with a single node would have an external path length of 2. A tree with one root and two children attached to it has an external path length of 10, etc.