qq_36029999的博客

namespace 折半查找实现 { class Program { static void Main(string[] args) { int[] nums = { 1, 6, 0, 3, 5, 7, 9, 5, 23, 2, 43, 64, 644, 5, 8 }; //int[] nums = {

堆排序： class Program { static void Main(string[] args) { int[] nums = { 1, 4, 8, 0, 3, 6, 9, 2 }; HeapSort(nums); for (int i = 0; i < nums.Length

带有重复计算： class Program { static void Main(string[] args) { // 索引代表 钢条的长度，值代表相应的价格 int[] prices = { 0, 1, 5, 8, 9, 10, 11, 17, 20, 24, 30 }; C

#include #include #include typedef struct Node { int data; struct Node *PNext; } NODE,*PNODE; PNODE Init(); void Traverse(PNODE pHead); bool Insert(PNODE pHead,int pos,int val); bool Dele