Readit News logoReadit News
beoba commented on What's Wrong with Meritocracy   the-diplomat.com/china-po... · Posted by u/Torn
gte910h · 15 years ago
Feels highly political, especially with the original title.

We're not trying to get into Harvard, so not particularly relevant.

While you may be a lurker here, and so may not have it, many of us have a "flag" button. This will delete the article from the site if a pretty small number of us click it.

Therefore, I wish, in addition to this button, I also had a button that said "has some value, just get it out of the curated HN space, and transfers it to reddit".

So if it's interesting to hackers, it's via politics (which HN tends to be flag happy about), and about a stage in life where pretty much everyone here is past (college admissions), to an institution which isn't really that common for the startupy type of person to strive for (usually preferring Stanford or MIT).

I do think it's interesting, I just would prefer to see it on a site where the politics can be discussed without the stink of political opinion interfering with the startup community.

I view sticking stuff like this on HN is akin to having heated political discussions before interviewing for a job or partnership: a universally bad idea.

I wasn't being glib. It is an interesting article, just not one I want to see change my opinion of people I discuss technical things with all the time. People tend to be more blind to assumption about politics than many other topics, so it's a good way to make yourself think less of people.

Things close to this I would think on topic for HN:

A blog post going into how the hacker community isn't like this.

The ways that scions of tech are different than other parents when the second generation comes around.

Etc.

beoba · 15 years ago
The article isn't really about university admissions at all, they're merely provided as one cause of an environment which also has its parallels in startup life.

Arbitrary illustrative excerpt:

Whether American or Chinese, individuals who focus too much on ‘achievement,’ and who believe the illusion that they’ve achieved everything simply through their own honest hard work, often think very little of everyone else as a result.

beoba commented on What's Wrong with Meritocracy   the-diplomat.com/china-po... · Posted by u/Torn
beoba · 15 years ago
A very good article, though I wish the author weren't so enamored with David Brooks clichés.
beoba commented on Index Funds Considered Harmful (Possibly Evil)   byrnehobart.com/blog/inde... · Posted by u/byrneseyeview
beoba · 15 years ago
You're just annoyed that you made a bad decision with your money, and feel that someone else should shoulder the blame. Yet somehow it isn't the fault of the active investors who take all that expense cash in return for consistently unperforming; no sir, blame the indexers! Is this what your "Financial Advisor" told you while he was skimming 1-5% off the top?

In other news, Buggy Whip Owner Considers Cars Harmful (Possibly Evil).

beoba commented on Eth0 no more?   lists.us.dell.com/piperma... · Posted by u/PassTheAmmo
beoba · 15 years ago
Looks like this could solve the problem of network interfaces renaming themselves after reboots. Hooray!
beoba commented on The Boxee Box Experience Now: Netflix, Vudu HD and Lots More Refinement   hothardware.com/Reviews/B... · Posted by u/MojoKid
beoba · 15 years ago
I have a lot of local video files, and I've (briefly) tried the Boxee software a couple times. It has a feature where it tries to identify that media, but I've found it to be comedically awful at doing so, especially when it comes to TV series, where it tends to pick out maybe one or two episodes from a given series directory, then for some reason completely ignore the rest, even though they're all following the same format in their respective filenames.

Does anyone know of a way to just turn this off entirely? I already have things organized by directory/filename. From what I can tell, the current 'solution' is to manually go through each file and fix whatever stupid information was auto-detected. Which is backwards, because if someone's anal enough to deal with that, they've likely already got things meticulously organized how they want by directory/filename, so why not just go by that directly?

I get the strong impression that they didn't really make local media playback a priority.

beoba commented on Windows Phone Marketplace bans the GPL, and the App Store should too   arstechnica.com/microsoft... · Posted by u/soofaloofa
rimantas · 15 years ago
Open source != GPL licensed apps. I know little about MS embracing open source, but regarding Apple check out these: http://www.apple.com/opensource/ , http://opensource.apple.com/ If I got it right Apple has little problems with GPL apps on App store, GPL proponents have.
beoba · 15 years ago
No, they've both chosen a distribution model which is incompatible with any software containing GPLv3 code. Sure, if the code is 100% yours, you can do whatever you want with it since you own the copyright. But if it has ever accepted contributions from anybody else under GPL terms, then it can't be done without breaking those terms.

They could work out a process for developers who want to contribute GPLed apps, but they've decided not to.

beoba commented on Typical programming interview questions.   maxnoy.com/interviews.htm... · Posted by u/gaiusparx
paulnelligan · 15 years ago
I'm going to play devil's advocate and say that while it is good to know these things, they're no longer essential. I graduated two years ago, and have been developing in Ruby since then, I haven't seen a linked list since College. Why?, because I chose to work with a newer language, with a higher level of abstraction. The programmer of the near future will have a different set of challenges to previously. In the same vein, the guys who graduated 10-15 years ago weren't learning Fortran. But 25 or 30 years ago, I'm guessing they were.
beoba · 15 years ago
Here's a quick example of a case where knowledge of data structures and algorithmic complexity is useful, regardless of the language.

Let's say you've got two lists, named "A" and "B", which each have 1000 integers. You want to return a list of unique integers which are present in both lists (ie the intersection of two lists). These 'lists' could be arrays or linked lists.

The brute force method would be something like this:

  Out = []
  for a in A:
    for b in B:
      if a == b and !Out.contains(b)://O(n) list search
        Out.append(b)
  return Out
But this can be very slow, because you can end up in the territory of O(n^3) iterations across A, B, and Out (internally the language would generally be iterating across Out in order to complete that 'contains' call). In this specific example, that works out to be something along the lines of 1000x1000x1000 = 1000000000 iterations, vastly larger than the size of the original lists.

---

A better way is to sort one or both of the lists then do the comparisons along each of them (this syntax assumes the lists are specifically arrays, but it'd effectively be the same for linked lists):

  Out = []
  sort(A)
  sort(B)
  b = 0
  for a in xrange(len(A)):
    vala = A[a]
    valb = B[b]
    if vala == valb:
      Out.append(vala)
      ++a
      ++b
    elif vala < valb:
      ++a
    else://vala > valb
      ++b
  return Out
This is definitely better than the above example. Now we're performing two sorts, each O(n log n), then we're doing a linear iteration across both of those lists in parallel, each O(n). So now we end up with an overall complexity of O(n log n) as a result of those initial sorts. Let's estimate the total number of iterations to be around, I dunno, 10000(sort)+2000(iterate/compare) = 12000? The exact number of comparisons in a sort can vary by algorithm used and how things were ordered in the lists to begin with.

Not bad, definitely better than what we were doing before. But we might be able to go a little better...

---

Yet another way is to use some hash sets, which (generally) have O(1) insertions and retrievals, and only store unique values, such that if you insert the same value twice, the second insertion is effectively ignored. We can do something like this:

  Out_set = set([])
  A_set = set([a in A])
  for b in B:
    if A_set.contains(b)://O(1) set search
      Out_set.append(b)
  return list(Out_set)//optional, could return Out_set
Now we end up with an algorithm which is O(n), where we iterated over the items in A once to fill in A_set, then we iterated over the items in B once, and each "contains" call was an O(1) hash lookup inside of A_set. Then finally we iterated over Out_set once to create the output list. This final step is optional, we could also have just returned Out_set directly, but it doesn't effect algorithmic complexity in either case. Now we've got 2000-3000 iterations, depending on how whether we return a set or a list. And this additionally looks a bit simpler than the sort+iterate version I gave above.

---

So just by using our knowledge of data structures, we've turned ~1000000000 iterations into ~2000-3000 iterations. This is on the order of reducing the distance to the moon to around a kilometer. And that's just with two lists that are limited to 1000 items each.

And this sort of thing is a pretty common scenario in any language, no matter how 'abstracted' it is.

beoba commented on Typical programming interview questions.   maxnoy.com/interviews.htm... · Posted by u/gaiusparx
akavlie · 15 years ago
What sort of programming positions?

I've done a fair amount of web development in PHP & Python (as well as introductory C++ & Java). I had to look up "linked list" on Google just to get some understanding of what that is.

beoba · 15 years ago
Woah, you may want to learn about those.

Understanding algorithmic complexity and knowing which data structure(s) to use to solve a given problem are universal skills.

beoba commented on Why I don't care very much about tablets anymore   arstechnica.com/staff/car... · Posted by u/zdw
epochwolf · 15 years ago
I beg to differ on the production thing. I do some of my fiction writing on my iPad using a Bluetooth keyboard.
beoba · 15 years ago
Where does the tablet go when you're not holding it?

This setup rapidly turns into a series of kludges to make the thing work.

beoba commented on Why I don't care very much about tablets anymore   arstechnica.com/staff/car... · Posted by u/zdw
JeffL · 15 years ago
I think it's interesting that he mentions that monitor + keyboard is better than a tablet because it separates out the input from the output areas and the "hands don't get in the way". But if you take the total surface of the keyboard plus your desktop monitors, it's way bigger than the area of the tablet. Make a giant tablet that's 32"x32" or some such, and I think it could be superior to monitor + keyboard for some things. The tablet lets you mix what areas are input and what are output for various applications, and that's way more flexible than being locked into fixed proportions.
beoba · 15 years ago
https://www.microsoft.com/surface/

All that's missing is a smug logo, and it'll be a hit!

(also mentioned in the article)

u/beoba

KarmaCake day607December 17, 2010
About
eqoaq
View Original