On the public citation graph

Cross-Language Comparative Study and Performance Benchmarking of Sorting Algorithms

https://doi.org/10.2139/ssrn.5088751
0 signed · 18 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/spe.2411openalex-snapshot
Compact visualization of Java program execution
inferredcites →https://doi.org/10.1007/978-3-031-17292-2_15openalex-snapshot
A Visual Tool to Study Sorting Algorithms and Their Complexity
inferredcites →https://doi.org/10.1093/comjnl/35.6.660openalex-snapshot
A Short Note on Perfectly Balanced Binary Search Trees
inferredcites →https://doi.org/10.1109/aiiot58432.2024.10574695openalex-snapshot
A Cost-Sensitive Learning Approach with Multi-Class Classification and Undersampling Techniques for Pest Identification in the Coconut Leaf Dataset
inferredcites →https://doi.org/10.1109/conit51480.2021.9498490openalex-snapshot
Asymptotic Analysis of the Running Time Performed by Various Sorting Algorithms
inferredcites →https://doi.org/10.1109/contesa57046.2022.10011382openalex-snapshot
A Review of Performance and Complexity on Sorting Algorithms
inferredcites →https://doi.org/10.1109/ic457434.2024.10486661openalex-snapshot
Exhaustive Analysis and Time Complexity Evaluation of Sorting Algorithms
inferredcites →https://doi.org/10.1109/iccsai53272.2021.9609715openalex-snapshot
Comparative of Advanced Sorting Algorithms (Quick Sort, Heap Sort, Merge Sort, Intro Sort, Radix Sort) Based on Time and Memory Usage
inferredcites →https://doi.org/10.1109/iceca.2019.8822135openalex-snapshot
An Efficient Sorting Techniques for Priority Queues in High-Speed Networks
inferredcites →https://doi.org/10.1109/iceccme55909.2022.9988424openalex-snapshot
Performance Measurement of Popular Sorting Algorithms Implemented using Java and Python
inferredcites →https://doi.org/10.1109/icit59216.2023.10335840openalex-snapshot
A Review of Algorithms’s Complexities on Different Valued Sorted and Unsorted Data
inferredcites →https://doi.org/10.1109/icoei48184.2020.9142934openalex-snapshot
Cloud Service Provider Selection using Non-Dominated Sorting Genetic Algorithm
inferredcites →https://doi.org/10.1109/icotl59758.2023.10435020openalex-snapshot
Binary Search Sort Algorithm -Yet Another Sorting Algorithm with Binary Search having O(nlogn) and O(n) time complexity
inferredcites →https://doi.org/10.1109/ised59382.2023.10444609openalex-snapshot
Performance Analysis of Various Sorting Algorithms: Comparison and Optimization
inferredcites →https://doi.org/10.1109/mace.2011.5987184openalex-snapshot
Experimental study on the five sort algorithms
inferredcites →https://doi.org/10.1109/nelex59773.2023.10421682openalex-snapshot
Combinatorial Bat Optimization for WSN with Hoover Index Clustering
inferredcites →https://doi.org/10.1109/smartgencon56628.2022.10084261openalex-snapshot
Performances of Sorting Algorithms in Popular Programming Languages
inferredcites →https://doi.org/10.1109/upcon52273.2021.9667586openalex-snapshot
Algorithm Visualizer: Its features and working
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.