oyhi

说明：  a)需求分析： 任务：建立南京主要公交线路图。 要求：输入任意两地点，给出最佳的乘车线路和转车地点。 b)概要设计： 本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 (a) Requirements Analysis : Mandate : the establishment of the Nanjing main transit route map. Requirements : 2 importation arbitrary locations, is the best car lines and interchange locations. B) Summary of design : the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.)

ir scope gnu code monitoring ir signal

自己做的一个基于单片机的万年历的程序 用液晶显示(Own a calendar based on single-chip liquid crystal display using the procedures)

ARMAX辨识，利用输入输出数据辨识系统模型(ARMAX identification using input and output data to identify)

公英制互转换器，初学VC时的小程序，对平时工程制图有些用处。(Metric to Imperial Units )

说明：  以3月5日为例，应该先把前两个月的加起来，然后再加上5天即本年的第几天，特殊 　　　　　　 情况，闰年且输入月份大于3时需考虑多加一天。(To March 5, for example, should the first two months of the combined first and then add the 5th day of the first few days of this year, special circumstances, a leap year and enter the 3 months to consider more than one day.)

说明：  在视图区画正弦函数曲线，并且在一个菜单下以对话框形式输入正弦图的起点和终点坐标。(In the view area sine curve drawing, and in the form of a menu in the dialog box enter the start and end the sine map coordinates.)

分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)

顺序表插入x值顺序表插入x值顺序表插入x值(Insert x value of the order sequence table table table is inserted into the x value of the order value of x)

是一个万年历功能的程序，可以查询某年某天是星期几(A year of day is a calendar function, you can query the day of the week)