资源列表
KenKenPuzzle
- 此程序采用回溯法求解了KenKen 问题。关于KenKen问题的描述，详见www.kenken.com-This program uses backtracking Solving KenKen issues. KenKen problem descr iption, see www.kenken.com ..
ProgrammingPearls(chs)
- 编程珠玑中文版，提高编程技巧的一本很好很强大的参考书，适合编程发烧友或者从业人员使用-Programming Pearls Chinese edition, a very good reference book to improve programming skills for programming enthusiasts or practitioners use
ComplexCalculator
- c++复数类计算器，支持用户直接输入日常书写习惯的表达式。原理：你波兰表达式+栈-c++ complex class calculator, support direct user input daily writing habits of expression. How it works: you Polish expression+ stack
Data-structure-calculations
- 包括对栈、图、链表、队列、二叉树等的操作。-Including the operation of the stack, linked lists, queues, binary tree.
Single-linked-list
- 使用C#图形界面，演示单链表的删除、插入、查找等功能。使用画图工具，实时画出每个节点和连线-Use the graphical interface of the C# demo single linked list, delete, insert, search functions. Use drawing tools, real draw for each node and connection
Archive
- binaryNode 和 binarysearchtree 是实现了一个二叉树。arrayvector是自己实现的vector。binary search 是一个二元搜索方法。 single list是自己实现的一个单向链表。findthemajority是寻找数组中主元素的一个算法。list是用数组实现的一个链表。permute是一个实现全排列的算法。-binaryNode and binarysearchtree is the realization of a binary tree. ar
Source-code
- DATA STRUCTURE BST STACK QUEUE AVL TREE HEAPSORT-DATA STRUCTURE BST STACK QUEUE AVL TREE HEAPSORT
C-Program
- 雅克比过关法算法求矩阵的奇异值分解，是雅克比算法的优化，提高计算速度-Jacobian immigration law algorithms singular value decomposition of a matrix, Jacobi algorithm optimization, improve computing speed
1
- 1.能输入包括空格的任意字符串，长度不限； 2.统计26个英文字母的使用频率； 3.按使用字母频率由大到小，输出字母极其频率。 -Can enter any string, including spaces, the length is not limited 2. Statistical frequency of use of the 26 letters of the alphabet 3. Descending frequency by using the alphabet
the_k_shortest_path
- 第k短路算法，用A*算法和优先队列实现。查找任意两点间的第k短路，时间复杂度O(NLOGN)-K-shortest path algorithm, A* algorithm and priority queue. Find the first k short circuit between any two points, the time complexity of O (NLOGN)
r141
- codeforces r141 题目A, 算法，编程，ACM，coding-codeforces r141 Problem A
sort
- 快速排序 排序中的性能很好但是不稳定的算法，时间复杂度为nLogN-Quicksort sort performance is good but unstable algorithm time complexity is nLogN