A Machine Learning Approach to Predicting the Smoothed Complexity of Sorting Algorithms

03/23/2015
by   Bichen Shi, et al.
0

Smoothed analysis is a framework for analyzing the complexity of an algorithm, acting as a bridge between average and worst-case behaviour. For example, Quicksort and the Simplex algorithm are widely used in practical applications, despite their heavy worst-case complexity. Smoothed complexity aims to better characterize such algorithms. Existing theoretical bounds for the smoothed complexity of sorting algorithms are still quite weak. Furthermore, empirically computing the smoothed complexity via its original definition is computationally infeasible, even for modest input sizes. In this paper, we focus on accurately predicting the smoothed complexity of sorting algorithms, using machine learning techniques. We propose two regression models that take into account various properties of sorting algorithms and some of the known theoretical results in smoothed analysis to improve prediction quality. We show experimental results for predicting the smoothed complexity of Quicksort, Mergesort, and optimized Bubblesort for large input sizes, therefore filling the gap between known theoretical and empirical results.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/29/2018

Generalized Leapfrogging Samplesort: A Class of O(n ^2 n) Worst-Case Complexity and O(n n) Average-Case Complexity Sorting Algorithms

The original Leapfrogging Samplesort operates on a sorted sample of size...
research
05/31/2022

Efficient Algorithms for Sorting in Trees

Sorting is a foundational problem in computer science that is typically ...
research
11/02/2018

Worst-Case Efficient Sorting with QuickMergesort

The two most prominent solutions for the sorting problem are Quicksort a...
research
10/29/2018

Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme

This paper presents simple variants of the BlockQuicksort algorithm desc...
research
06/24/2016

Asymptotic and exact results on the complexity of the Novelli-Pak-Stoyanovskii algorithm

The Novelli-Pak-Stoyanovskii algorithm is a sorting algorithm for Young ...
research
05/31/2013

Theoretical formulation and analysis of the deterministic dendritic cell algorithm

As one of the emerging algorithms in the field of Artificial Immune Syst...
research
04/20/2022

Theoretical analysis of edit distance algorithms: an applied perspective

Given its status as a classic problem and its importance to both theoret...

Please sign up or login with your details

Forgot password? Click here to reset