jsjxy2009的专栏

package org.rut.util.algorithm; import org.rut.util.algorithm.support.BubbleSort; import org.rut.util.algorithm.support.HeapSort; import org.rut.util.algorithm.support.ImprovedMergeSort;

#include #include #include #include using namespace std; typedef struct student{ int data; struct student *next; struct student *pre; }dnode; //建立双链表 dnode *create(){ dnode *head,*p,*s; int

#include