使用 Javascript 编程语言的排序算法在计算时间和内存使用量方面的比较

STRING (Satuan Tulisan Riset dan Inovasi Teknologi) Pub Date : 2024-04-05 DOI:10.30998/string.v8i3.17972

Surya Wijaya, Fauziah Fauziah, T. Harjanti

{"title":"使用 Javascript 编程语言的排序算法在计算时间和内存使用量方面的比较","authors":"Surya Wijaya, Fauziah Fauziah, T. Harjanti","doi":"10.30998/string.v8i3.17972","DOIUrl":null,"url":null,"abstract":"Data that is sequential or neatly arranged data is highly necessary because sorted data makes it easier to read, inspect, and correct any erroneous data. In information technology, there are many algorithms for data sorting, including merge sort, insertion sort, heap sort, quick sort, selection sort, shell sort, and so on. In this test, seven sorting algorithms (Merge Sort, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort, Selection Sort","PeriodicalId":177991,"journal":{"name":"STRING (Satuan Tulisan Riset dan Inovasi Teknologi)","volume":"11 5","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-04-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Perbandingan Algoritma Sorting dengan Menggunakan Bahasa Pemograman Javascript dalam Penggunaan Waktu Komputasi dan Penggunaan Memori\",\"authors\":\"Surya Wijaya, Fauziah Fauziah, T. Harjanti\",\"doi\":\"10.30998/string.v8i3.17972\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data that is sequential or neatly arranged data is highly necessary because sorted data makes it easier to read, inspect, and correct any erroneous data. In information technology, there are many algorithms for data sorting, including merge sort, insertion sort, heap sort, quick sort, selection sort, shell sort, and so on. In this test, seven sorting algorithms (Merge Sort, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort, Selection Sort\",\"PeriodicalId\":177991,\"journal\":{\"name\":\"STRING (Satuan Tulisan Riset dan Inovasi Teknologi)\",\"volume\":\"11 5\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-04-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"STRING (Satuan Tulisan Riset dan Inovasi Teknologi)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.30998/string.v8i3.17972\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"STRING (Satuan Tulisan Riset dan Inovasi Teknologi)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30998/string.v8i3.17972","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

顺序排列或整齐排列的数据是非常必要的，因为排序后的数据更容易读取、检查和纠正错误数据。在信息技术中，数据排序的算法有很多，包括合并排序、插入排序、堆排序、快速排序、选择排序、贝壳排序等。在本测试中，有七种排序算法（合并排序、插入排序、气泡排序、堆排序、快速排序、选择排序、贝壳排序）。

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

查看原文本刊更多论文

Perbandingan Algoritma Sorting dengan Menggunakan Bahasa Pemograman Javascript dalam Penggunaan Waktu Komputasi dan Penggunaan Memori

Data that is sequential or neatly arranged data is highly necessary because sorted data makes it easier to read, inspect, and correct any erroneous data. In information technology, there are many algorithms for data sorting, including merge sort, insertion sort, heap sort, quick sort, selection sort, shell sort, and so on. In this test, seven sorting algorithms (Merge Sort, Insertion Sort, Bubble Sort, Heap Sort, Quick Sort, Selection Sort

求助全文

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

来源期刊

STRING (Satuan Tulisan Riset dan Inovasi Teknologi)

自引率

0.00%

发文量