Visualizar tabela do banco de dados

魔法单词记忆――DAO访问ACCESS数据库-magic word memory-- DAO visit ACCESS database

堆排序 稳定的排序 复杂度为N（logN ） 也是一种快速的排序-HEAPSORT stable sort complexity is N (logN) is a fast sorting

实现各种内部排序。包括冒泡排序，直接插入排序，Shell排序，快速排序，堆排序，并比较排序的比较次数和移动次数。主要是C语言。-achieve internal order. Including bubble sort, direct insertion sort, Shell sort, quick sort, heap sort, and compare the ranking of number and mobile number. C is the main language.

背包问题运用贪婪算法的matlab 程序实现-Use of greedy algorithm knapsack problem of matlab program

PKU 上的几个题目 Tunnel Warfare Unique Solution Washing Clothes Weather Forecast Who Gets the Most Candies -PKU on several topics Tunnel WarfareUnique SolutionWashing ClothesWeather ForecastWho Gets the Most Candies

从数组中 任取一个元素 p (可随机取,现在以取第一个为例).以P作为主元,对数组 进行划分 ,前一部分小于 P,后一部分 大于p.最后划分处存储p,然后分别对划分后的前一部分和后一部分递归调用. 算法平均时间复杂度: O(nlogn) -Any check from the array element p (can be random access, and now to take the first example). To P as the main element of the array to be divided, the first part is less than P, the latter part of the final division is greater than p. Department store p , and then were divided into the first part and the latter part of recursive calls. algorithm the average time complexity: O (nlogn)

一个合并排序算法。是按照《算法导论》书中的讲解来写的。-A plan to merge sorting algorithm. In accordance with the

这是数据结构中树的全部实现代码，对学习数据结构的同学很有帮助-this is a code of data structure

数据结构（严蔚敏）的试验指导书籍，非常方便的一本书- i usuless for foreign school, it is a book about china s tutorial

FP树算法源代码 FP树算法源代码-tree FP algorithm source code tree FP algorithm source code tree algorithm source code