Description: Comparison of the internal sorting algorithm
Problem description: internal sorting algorithm demonstrates the preparation of a comparative process. Can bubble sort, direct insertion sort, simple selection sort, quick sort, sort and heap sort Hill comparison.
Algorithm Input: sorting method selection, the elements to be sorted keywords, given the sequence mode (positive sequence, reverse and random order)
Algorithm output: keywords under different circumstances the number of comparisons involving the mobile number and keyword.
Algorithm points: (1) sort the table by the keyboard input table to be long (50 to 100) and different number of groups of test data. (2) methods using different sort order and the number of statistical categories, the list display (3) program implementation through dialogue.
To Search:
- [my-sort] - internal sorting algorithm, six kinds of
- [paixu] - Comparison of the internal sorting algor
File list (Check if you may need any files):
sss\Debug\sss.exe
...\.....\sss.pdb
...\.....\ssss.obj
...\.....\vc60.pdb
...\Debug
...\sss.dsp
...\sss.dsw
...\sss.ncb
...\sss.opt
...\sss.plg
...\ssss.cpp
sss
xxxx\Debug\test.obj
....\.....\vc60.pdb
....\.....\xxxx.exe
....\.....\xxxx.pdb
....\Debug
....\DLNode.h
....\message_list
....\SeqList.h
....\SLNode.h
....\sssss.h
....\test.cpp
....\Test2.cpp
....\xxxx.dsp
....\xxxx.dsw
....\xxxx.ncb
....\xxxx.opt
....\xxxx.plg
....\zzz.h
xxxx
数据结构 课程设计报告.doc
Download