Description: (1). Fast sorting algorithm order of the table, how to choose a community value (also known as an axis element), affecting the efficiency of quick sort, and community values are not necessarily sequential list is an element. For example, we can be divided by the average of all the elements in the sequence as the cutoff value. Write algorithm is bounded to the average value of fast sorting method.
(2). There n elements to be sorted is stored in a single list without meter nodes, each node lists only a storage element, the head pointer r. Try to design an algorithm, its way merge sort, asked not to move the nodes of elements, each link points only change pointers sorted r still indicates the result list of the first node.
To Search:
File list (Check if you may need any files):
Debug
.....\vc60.idb
.....\vc60.pdb
.....\顺序表和链表选作实验.exe
.....\顺序表和链表选作实验.ilk
.....\顺序表和链表选作实验.obj
.....\顺序表和链表选作实验.pch
.....\顺序表和链表选作实验.pdb
顺序表和链表选作实验.cpp
顺序表和链表选作实验.dsp
顺序表和链表选作实验.dsw
顺序表和链表选作实验.ncb
顺序表和链表选作实验.opt
顺序表和链表选作实验.plg
Download