” Greddy Algorithm ” 該如何解釋 ?

請問各位大大,該如何解釋 \" Greddy Algorithm \" 呢 ..... ? 謝謝 !!

3 Answers

Rating
  • 1 decade ago
    Best Answer

    貪婪演算法(Greedy Algorithm)

    我的見解:

    貪婪演算法(Greedy Algorithm)類似於動態規劃演算法(Dynamic Programming Algorithm), 但是差別在於Greedy Algorithm解題步驟中不需要知道所有子問題的答案,它只是"貪婪"的選擇一個可能看起來最好的子問題來做。它不一定給出最佳解,但是卻很有效率。最著名的Greedy Algorithm是Kruskal的最小生成樹(Minimal Spanning Tree)演算法。

    英文定義:

    An algorithm that always takes the best immediate, or local, solution while finding an answer. Greedy algorithms find the overall, or globally, optimal solution for some optimization problems, but may find less-than-optimal solutions for some instances of other problems.

    幾各著名的Greedy Algorithm:

    Dijkstra's algorithm

    http://www.nist.gov/dads/HTML/dijkstraalgo.html

    Huffman coding

    http://www.nist.gov/dads/HTML/huffmanCoding.html

    Kruskal's algorithm

    http://www.nist.gov/dads/HTML/kruskalsalgo.html

    Optimal Merge

    http://www.nist.gov/dads/HTML/optimalMerge.html

    Prim-Jarnik algorithm

    http://www.nist.gov/dads/HTML/primJarnik.html

    Source(s): 剛考完演算法資格考
  • 1 decade ago

    通常以Greedy Algorithm著稱的問題是Optimal Solution

  • wern
    Lv 5
    1 decade ago

    西瑪啦喔喔!!你該不會是我學長吧!!

Still have questions? Get your answers by asking now.