资源列表
O(logN)sort
- 时间复杂度为O（logN）的排序算法。。俗称重口味排序-Time complexity is O (logN) sorting algorithm. . Commonly known as the flavors sort
31
- 牛顿插值法 以及 拉格朗日 插值法的简单算法-Newton interpolation method and a simple algorithm for Lagrange interpolation
Bubble_sort
- program for bubble sort
h34
- 用c++语言描述的 用链表存储的 判断字符串左右是否对称-whether string is equal
6
- 用链表实现多项式相加。结构体定义，多项式的初始化，输入、输出。-Sum of polynomials with linked implementation. Structure definition, the polynomial initialization, input, output.
First-Heapsort
- 我的第一次自己写的堆排序算法，希望大家好好看，其实是为了凑字数-My first time to write their own heap sorting algorithm, I hope you look good, in fact, is to scrape together words
link
- 这是一个最简单的链表实现，单链表，完成一个在链表当中结点的数据插入-This is a simple linked list, singly linked list
6
- 关于图的dijkstra算法，很简单，发上来分享下-The dijkstra algorithm on the graph is very simple, made up under shared
middle-num
- 一个求中位数 算法复杂度为0（n）的小程序-get middle number which time is 0（n）
integersplit
- 利用非递归算法将正整数n表示成一系列正整数之和，n=n1+n2+...+nk，其中n1>=n2>=n3>=...>=nk>=1，k>=1。 正整数n的这种表示称为正整数n的划分。 -N represents a positive integer into a series of positive integers and the use of a non-recursive algorithm, n = n1+n2+ ...+nk, wherei
staticStac
- 用C语言实现的动态栈的算法，清晰明了，方便学习-Using C language implementation of the dynamic stack algorithm, clear, easy to learn
EvaluateReversePolishNotation
- Evaluate the value of an arithmetic expression in Reverse Polish Notation. Valid operators are +, -, *, /. Each operand may be an integer or another expression. Some examples: [ 2 , 1 , + , 3 , * ] -> ((2 + 1) * 3) -> 9 [ 4 ,