{"action":"opened","issue":{"url":"https://api.github.com/repos/Candalk/PAT-First-Division/issues/9","repository_url":"https://api.github.com/repos/Candalk/PAT-First-Division","labels_url":"https://api.github.com/repos/Candalk/PAT-First-Division/issues/9/labels{/name}","comments_url":"https://api.github.com/repos/Candalk/PAT-First-Division/issues/9/comments","events_url":"https://api.github.com/repos/Candalk/PAT-First-Division/issues/9/events","html_url":"https://github.com/Candalk/PAT-First-Division/issues/9","id":269291549,"number":9,"title":"插入排列与堆排列的区别","user":{"login":"Candalk","id":18608310,"avatar_url":"https://avatars0.githubusercontent.com/u/18608310?v=4","gravatar_id":"","url":"https://api.github.com/users/Candalk","html_url":"https://github.com/Candalk","followers_url":"https://api.github.com/users/Candalk/followers","following_url":"https://api.github.com/users/Candalk/following{/other_user}","gists_url":"https://api.github.com/users/Candalk/gists{/gist_id}","starred_url":"https://api.github.com/users/Candalk/starred{/owner}{/repo}","subscriptions_url":"https://api.github.com/users/Candalk/subscriptions","organizations_url":"https://api.github.com/users/Candalk/orgs","repos_url":"https://api.github.com/users/Candalk/repos","events_url":"https://api.github.com/users/Candalk/events{/privacy}","received_events_url":"https://api.github.com/users/Candalk/received_events","type":"User","site_admin":false},"labels":[],"state":"open","locked":false,"assignee":null,"assignees":[],"milestone":null,"comments":0,"created_at":"2017-10-28T07:14:52Z","updated_at":"2017-10-28T07:14:52Z","closed_at":null,"author_association":"OWNER","body":"插入排列：\r\n插入排列从头开始以此插入前面的的有序队列，并依次进行排列。\r\n堆排列：\r\n堆排列分为大顶堆和 小顶堆，利用二叉树的性质，未排好序大顶堆的父节点都要比其两个孩子节点的值都要大，对用一个一维数组A来表示，i表示父节点，则A[i]>A[2*i]&&A[i]>A[2*i+1]。\r\n那么如何进行堆排列呢？\r\n```\r\n首先将最顶端的元素放到未排好序元素的最后一个元素交换。\r\n其次按照大顶堆的定义重新调整顺序\r\n```"}}
{"actor":{"display_login":"Candalk"}}