Programming

Saturday, January 9, 2016

Heap (data structure)

Heap - specialized tree (usually binary) data structure adhere, conform to heap property: parent node key is greater(less) then child nodes for two heap types max heap (min heap)

Used in heap sort algorithm and Dijkstras graph algorithm

Heap Sort - use max-heapify alg N times

Heap (data structure) - Wikipedia, the free encyclopedia:
Posted by pavel at 10:04 AM
Email ThisBlogThis!Share to XShare to FacebookShare to Pinterest

No comments:

Post a Comment

Newer Post Older Post Home
Subscribe to: Post Comments (Atom)

Blog Archive

  • ▼  2016 (16)
    • ►  October (5)
    • ►  May (1)
    • ►  March (2)
    • ►  February (2)
    • ▼  January (6)
      • UML 2 Diagrams
      • Robustness (computer science)
      • Fuzz testing ~ random input testing
      • Logarithm(log, lg, ln), Logarithmic Formulas
      • Heap (data structure)
      • Stack (LIFO), QUEUE (FIFO) - mnemonics sample
  • ►  2015 (72)
    • ►  December (5)
    • ►  November (5)
    • ►  October (5)
    • ►  September (5)
    • ►  July (3)
    • ►  June (18)
    • ►  May (10)
    • ►  April (17)
    • ►  February (2)
    • ►  January (2)
  • ►  2014 (49)
    • ►  December (5)
    • ►  September (1)
    • ►  August (3)
    • ►  July (4)
    • ►  June (1)
    • ►  May (5)
    • ►  April (5)
    • ►  March (4)
    • ►  February (10)
    • ►  January (11)

About Me

pavel
View my complete profile
Simple theme. Powered by Blogger.