Boiledbeans

Drama! Intrigue! Geekiness!

December 27, 2008

Excessive desire

devadutta @ 11:51 pm, GMT +0000 ( 1230421915 ) Play

1 discovered this algorithm first. 2 independently discovered it again 27 years later. 3 discovered it again 2 years later. Which?
1. 645795645323486530b6c1fbc913e1f2 2. 570e0ff4e3667830ccc1ca2894c66808 3. db37c97dcd560111c1fa955f80601cdf

Hint: Every guy who has got screwed for using goto statements in C/C++ will know 3.

Cracked by: sriram , username , Goyal. Very Nice!

Answer:

1. Vojtěch Jarník
2. Robert Prim
3. Edsger Dijkstra

The DJP algorithm – more famously known as the Prim’s Algorithm.


8 Responses to “Excessive desire”

  1. sriram

    1. Vojtěch Jarník
    2. Robert Prim
    3. Edsger Dijkstra

    The DJP algorithm


  2. 3rd pic : Edsger Dijkstra

    Reverse Polish notation


  3. username
    3
    3
    1

    1. Jarnik Vojtech
    2. Robert C. Prim
    3. Edsger Dijkstra

    Prim’s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. The algorithm was discovered in 1930 by mathematician Vojtěch Jarník and later independently by computer scientist Robert C. Prim in 1957 and rediscovered by Edsger Dijkstra in 1959.
    http://en.wikipedia.org/wiki/Prim%27s_algorithm


  4. Goyal
    3
    2
    1

    Prim’s Algorithm

    1. Vojtěch Jarník
    2. Robert C. Prim
    3. Edsger Dijkstra – A Case against the GO TO Statement


  5. malcaluffin

    shortest path algorithm


  6. Neeraj

    1. Vojtěch Jarník
    2. Robert C. Prim
    3. Edsger Dijkstra

    they all discovered the Min Spanning Tree algo


  7. Dibyo
    11
    14
    10

    Jarnik – Prim – Dijkstra – shortest path algorithm


  8. Rahulk
    2
    5

    Shortest Path Algorithm


« Previous « You can’t repeat the past? « | » BFQ » Next »