基于链表的同构化首尾排序新算法——“程序设计”与“数据结构”课程的融合创新案例研究  

New Algorithms for Sorting from Head and Rear Based on Chain List——Fused and Innovated Case Study of "Program Design" and "Data Structure" Subjects

作　　者：周启海[1,2] 

机构地区：[1]西南财经大学信息技术应用研究所,成都610074 [2]西南财经大学经济信息工程学院,成都610074

出　　处：《计算机科学》2008年第11期229-231,共3页Computer Science

摘　　要：依据同构化基本原理,研究和发现了基于传统内部首尾排序算法的同构化特点与本质;进而,利用其同构化特点与本质,提出了几种基于链表的首尾排序新算法;从而,进一步深化和推广了首尾排序算法的应用方式与实用范围;同时,也为"程序设计"、"数据结构"的课程融合、教学改革、教育创新提供了重要研究案例。According to isomorphic fundamental principles, the isomorphic characters and natures of algorithms for sorting from head and rear based on traditional internal sorting were studied and found. Further, several new algorithms for sorting from head and rear based on chain lists were advanced by using their isomorphic characters and natures. Therefore, the application forms and applied ranges of algorithms for sorting from head and rear were deepened and expended. Provided an important studying case for fusing subjects, teaching reform and innovating education of ＂Program Design＂ and ＂Data Structure＂.

关 键 词：同构化 链表 首尾排序 算法 课程融合 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP311.12[自动化与计算机技术—计算机科学与技术]