Running time of the Treapsort algorithm

An Efficient Hybrid Algorithm for Energy Expenditure Estimation for Electric Vehicles in Urban Service Enterprises

“…The authors emphasize the fact that the important aspect of the carried out research is the comparison of the results of the proposed heuristics and their computational times with the result of the exact algorithm [78][79][80][81]. Due to the fact that we have focused strictly on the problem of determining the routes of delivery collection by electric vehicles, the analysis of the algorithm operation time was not presented in detail and can be considered in a future publication.…”

Skip (Insertion) Sort, Skip List Based New and Very Efficient Sorting Algorithm

“…In addition, several studies have been conducted so far on the improvement, compare and analysis of sorting algorithms. These studies are about Quicksort [23], The Analysis of Quicksort Programs [24] ,Running time of the Treapsort algorithm [25], QuickSort A Historical Perspective and Empirical Study [26], Efficient unbalanced merge-sort [27], Enhanced Merge Sort-a new approach to the merging process [28], Sorting and selection on dynamic data [29], SA Sorting: A Novel Sorting Technique for Large-Scale Data [30], Sorting Algorithms in MOQA [31], A new sorting algorithm [32], On demand string sorting over unbounded alphabets [33], Centroid Sort: a Clustering-based Technique for Accelerating Sorting Algorithms [34], Efficient sample sort and the average case analysis of PEsort [35], Analysis of Linear Time Sorting Algorithms [36], A Comprehensive Note on Complexity Issues in Sorting Algorithms [37], Comparison Analysis of Best Sorting Algorithms [38], Comparison of Sorting Algorithms based on Input Sequences [39], Optimized Selection Sort Algorithm is faster than Insertion Sort Algorithm: a Comparative Study [40], Randomized Shellsort: A Simple Oblivious Sorting Algorithm [41], An Enhancement of Major Sorting Algorithms [42], MinFinder: A New Approach in Sorting Algorithm [43].…”