coder007

I know, just a class version of the C-array but std::vectors has lower performance. I believe that std::array or C array are good enough for problems with non-dynamic input.

So you prefer to use std::array over C arrays?

Here's refined list using STL if you like -

http://www.techiedelight.com/data-structures-and-algorithms-...

This graph is based on influence relation data from the now defunct Freebase, which combined various data sources including Wikipedia. Gephi was used for the graph layout, node sizing and coloring and Sigma.js is used for rendering in the browser.

For the long version, see below article that is linked via the blue info button on top right. https://exploringdata.github.io/info/programming-languages-i...

On related topic (not necessarily graph):

DFS Interview Questions - http://www.techiedelight.com/dfs-interview-questions/

BFS Interview Questions - http://www.techiedelight.com/bfs-interview-questions/

>Does anyone really ask you to write this kind of code in interviews

Whoh!! All big IT companies ask these type of questions.. but mostly to graduate students and less experienced candidates.. but some companies might ask it to a 10 year old programmer as well..

MIT lectures are already mentioned in the end.. and from your link, one of the tutor is same (one with pony) and the content also looks the same..

To Read the Full Story, Subscribe or Sign In. No thanks!

They have mentioned Introselect which is a hybrid of quickselect and median of medians.

I have emailed them. post should be updated soon.

it doesn't return the index, rather the element itself..

here, numbering starts from 0 same as std::nth_element

it is clearly O(klogn). We are popping k times from a heap of size n.