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

Surya Wijaya, Fauziah Fauziah, T. Harjanti
{"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}
引用次数: 0

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
使用 Javascript 编程语言的排序算法在计算时间和内存使用量方面的比较
顺序排列或整齐排列的数据是非常必要的,因为排序后的数据更容易读取、检查和纠正错误数据。在信息技术中,数据排序的算法有很多,包括合并排序、插入排序、堆排序、快速排序、选择排序、贝壳排序等。在本测试中,有七种排序算法(合并排序、插入排序、气泡排序、堆排序、快速排序、选择排序、贝壳排序)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信