期刊文献+

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

New Algorithms for Sorting from Head and Rear Based on Chain List——Fused and Innovated Case Study of "Program Design" and "Data Structure" Subjects
下载PDF
导出
摘要 依据同构化基本原理,研究和发现了基于传统内部首尾排序算法的同构化特点与本质;进而,利用其同构化特点与本质,提出了几种基于链表的首尾排序新算法;从而,进一步深化和推广了首尾排序算法的应用方式与实用范围;同时,也为"程序设计"、"数据结构"的课程融合、教学改革、教育创新提供了重要研究案例。 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".
作者 周启海
出处 《计算机科学》 CSCD 北大核心 2008年第11期229-231,共3页 Computer Science
关键词 同构化 链表 首尾排序 算法 课程融合 Isomorphic, Chain list, Sorting from head and rear, Algorithm, Fusing subjects
  • 相关文献

参考文献4

二级参考文献8

共引文献4

同被引文献3

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部