If the numbers are unique you could use a bitmap-sort this way you could
easily read just parts of the file at a time.
If they aren't unique it gets a bit trickier.
/L
dinesh bansal wrote:
> Hi All,
>
> Suppose I have a big file (~100M) containing integer data. I want to sort
> this file. The p
I agree, if memory is not an issue use a breadth first search, but if
memory is an issue it can get quite interesting.
sharad kumar wrote:
> if its a digraph make use of topsort or make use of bfs
>
> On Thu, Dec 17, 2009 at 5:19 PM, vicky wrote:
>
>
>> given a graph G(V,E) and a source vert
There are some time differences and all, the vital part is that
bellman-ford handles negative weights on the edges in the graph,
Dijkstras does not.
Besides that there is some time difference and so forth.
Bellman-ford: O(V|E|)
Dijkstra: O(v²) ? (give or take depending on the heap or priority qu
Heres a nice little problem that has been keeping me up for days.
We have a set of n words (where a word is anything between two spaces).
Our printer only allows M characters per line included the spaces
between the lines.
We want to provide the optimal way of outputting our text with an even
sp
