文件名称:1-1
介绍说明－－下载内容均来自于网络，请自行研究使用
c++二、通过将其元素插入到双向链表中的方法对数组A进行排序。算法对链表的当前操作位置进行维护，当需要插入表项时，若新元素比当前位置值要大，则往前移动；若小则往后移动。编写函数DoubleSort实现上述排序算法。
template <class T>
void DoubliSort( T a[], int n)
-c++ Second, through its elements inserted into the two-way linked list of methods to sort array A. Algorithm to list the current operating position for maintenance, when the need to insert a table entry, if the new element to the location than the current value to big, then move forward if small is the next move. Prepared to achieve the above function DoubleSort sorting algorithm. template
template <class T>
void DoubliSort( T a[], int n)
-c++ Second, through its elements inserted into the two-way linked list of methods to sort array A. Algorithm to list the current operating position for maintenance, when the need to insert a table entry, if the new element to the location than the current value to big, then move forward if small is the next move. Prepared to achieve the above function DoubleSort sorting algorithm. template
(系统自动生成,下载前可以参看下载内容)
下载文件列表
1-1.cpp