Program to run the heaps, Leftist heaps are the heaps which contain higher depth on the left side of the heap.

本文详细介绍了堆（heap）和栈（stack），他们是非常重要的概念，当我们进行程序开发时理解它们非常重要， 尤其是对于嵌入式系统开发。-This paper describes the heap (heap) and stack (stack), they are very important concept, as we understand them when programs are developed is very important, especially for embedd

program to implement a binomial heap and do operations like insertion, extracting the minimum key node, decreasing the node key etc

能够实现起泡法，二分法，堆排序，插入排序，选择排序，快速排序六种方法对100个数进行排序的时间空间复杂度进行比较-To achieve foaming method, dichotomy, Heap Sort, Insertion Sort, Selection Sort, Quick Sort six methods on 100 the number of sort of time and space complexity comparison