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

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

依据同构化基本原理,研究和发现了基于传统内部首尾排序算法的同构化特点与本质;进而,利用其同构化特点与本质,提出了几种基于链表的首尾排序新算法;从而,进一步深化和推广了首尾排序算法的应用方式与实用范围;同时,也为"程序设计"、"数据结构"的课程融合、教学改革、教育创新提供了重要研究案例。

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＂.