【摘要】 利用静态链表的原理,冒泡排序算法在静态链表上实现时只改变结点的游标,排好序后再利用order优先搜索算法将每个记录移动到相应位置。实验及分析结果表明,记录移动的时间复杂度由O(n2)下降到O(n),当单个记录需要较大的存储空间时,效率较高。更多还原

【Abstract】 Making use of the principle of static linked list,the realization of bubble sort algorithm on static linked list only changes the cursor of nodes. After sorting,order first search is used to move every record to the corresponding position. Experimental results showed that the time complexity of record moving descends from O( n2) to O( n) and it has higher efficiency when a single record need larger storage space.更多还原