数据结构和排序算法的远程学习应用程序

ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534) Pub Date : 2002-11-07 DOI:10.1109/ITI.2002.1024664

M. Colnaric

{"title":"数据结构和排序算法的远程学习应用程序","authors":"M. Colnaric","doi":"10.1109/ITI.2002.1024664","DOIUrl":null,"url":null,"abstract":"In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of various algorithms can be calculated and/or measured.","PeriodicalId":420216,"journal":{"name":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","volume":"100 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An application for distance learning of data structures and sorting algorithms\",\"authors\":\"M. Colnaric\",\"doi\":\"10.1109/ITI.2002.1024664\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of various algorithms can be calculated and/or measured.\",\"PeriodicalId\":420216,\"journal\":{\"name\":\"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)\",\"volume\":\"100 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-11-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITI.2002.1024664\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITI.2002.1024664","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文给出了一个应用于数据结构和排序算法的演示和分析。它们的操作可以在断言的或生成的具有不同统计分布的输入数据上进行动画化和演示。可以计算和/或测量各种算法的性能和复杂性的分析。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

An application for distance learning of data structures and sorting algorithms

In the paper an application for demonstration and analysis of data structures and sorting algorithms is presented. Their operation can be animated and demonstrated on asserted or generated input data, with different statistical distributions. Analysis of the performance and of the complexity of various algorithms can be calculated and/or measured.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

ITI 2002. Proceedings of the 24th International Conference on Information Technology Interfaces (IEEE Cat. No.02EX534)

自引率

0.00%

发文量