任意阶一次幻方生成器 < 常用算法与数据结构 >

八种排序的方法,利用VC++实现,值得借鉴-eight ranking, using VC, which is worth learning from

Astar 精灵版本 -Astar Wizard Wizard version version Astar

数据结构中线性表的合并链式实现，VC++实现的。-Data structure in linear chain realize the merger table, VC++ Achievable.

在一个圆形操场的四周摆放着n堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的两堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分，并分析算法的计算复杂度。-in a circle around the playground are placed n gravel pile. Is a stone should order to be merged into a heap. Stipulated that only elected adjacent to the pile of gravel into the new heap, and a new pile of gravel credited for the combined scores. Design a test algorithm to calculate n heap into a pile of gravel to the minimum score and the biggest score and analysis of algorithm complexity.

北大大牛代码 1240道题的原代码 超级权威 -North Daniudi title code 1240 of the original super-authority of code

严蔚敏编写的《数据结构》第6章的答案，全部为源码-the answers of chapter 6 of a book called ‘Data Structures’ writen by Yan Wei Min

这里面包含了acm程序设计的各种常用的算法-contains acm procedures commonly used in the design of algorithms

ssd7考试2的答案，自己做的，98分的-2 answers ssd7 examination that he did, 98 points

数据结构 链表 按顺序合并两链表。 pa =1 2 4 7 9 11 16 pb= 1 6 9 23 24 36 1 1 2 4 6 7 9 11 16 23 24 36-link

考研数据结构辅导材料，包含6章（.ppt文档）-taking tests guidance material contained in Chapter 6 (. Ppt files)