Search - sort - CodeBus

Search - sort - List

[MacOS develop] Heap DL : 0: 这个代码包含了简单的堆操作，包括堆的保持，键堆，以及利用堆这个数据结构排序, 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
Date : 2026-01-15 Size : 314kb User : zhangjing
[MacOS develop] QuickSort DL : 0: 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 pivot, from the list. Reorder the list so that all elements with values less than the pivot come before the pivot, while all elements with values greater than the pivot come after it (equal values can go either way). After this partitioning, the pivot is in its final position. This is called the partition operation. Recursively apply the above steps to the sub-list of elements with smaller values and separately the sub-list of elements with greater values. The base case of the recursion are lists of size zero or one, which never need to be sorted.
Date : 2026-01-15 Size : 5kb User : domix
[MacOS develop] lab1 DL : 0: Objective C实现的简单的二分查找，查找前快速排序。-Objective C to achieve a simple binary search, find quick sort before.
Date : 2026-01-15 Size : 27kb User : 江婷
[MacOS develop] Search DL : 0: 二分查找的实现输入一个数组，程序将对其进行排序，并打印出排序结果再输入一个数，程序会查找这个数在已排序数组中的位序，并打印出来-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 array rank, and print them out
Date : 2026-01-15 Size : 1kb User : 小许