{"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