这个代码包含了简单的堆操作，包括堆的保持，键堆，以及利用堆这个数据结构排序, IDE为苹果的Xcode-this code show the heap related operation, include keeping a heap, building a heap, using heap to sort an array. The IDE is Xcode on Apple Mac

Quicksort is a divide and conquer algorithm. Quicksort first divides a large list into two smaller sub-lists: the low elements and the high elements. Quicksort can then recursively sort the sub-lists. The steps are: Pick an element, called a pivo

Objective C实现的简单的二分查找，查找前快速排序。-Objective C to achieve a simple binary search, find quick sort before.

二分查找的实现 输入一个数组，程序将对其进行排序，并打印出排序结果 再输入一个数，程序会查找这个数在已排序数组中的位序，并打印出来-Find the realization of two Enter an array, the program will be sorted, sort and print out the results Then enter a number, the program will find this number in the sorted ar