title: Build a max heap for an array
body: <p>I have a homework question that says:</p>
  
  <blockquote>
    <p>Problem 1: Given the array [ 22 | 25 | 71 | 24 | 18 | 5 | 27 | 32 | 104 | 8 | 23 | 66 ] Build
    a max-heap for the array. Show all steps without skipping any details.</p>
  </blockquote>
  
  <p>This is my understanding about the max-heap from researching on the internet:</p>
  
  <p>The max heap is an array that could be more easily represented with a binary tree where the parent node is always greater than it's children and "every time you add a child you added it towards the left so that every time the tree increases it's height it is a full tree"</p>
  
  <h2>  <a href="http://soundeliverance.com/temp/question1.pdf" rel="nofollow">Anyways this is what I have constructed</a></h2>
  
  <p>I thought that was the right answer until I read question 2 of my homework that say:</p>
  
  <blockquote>
    <p>Problem 2: Using the same array as in problem 1, sort the array using
    Heapsort. Show all steps without skipping any details.</p>
  </blockquote>
  
  <p>Now I am confused. Maybe I answered problem number 2... </p>