DeepAI AI Chat
Log In Sign Up

Apply Sorting Algorithms to FAST Problem

by   Sadra Mohammadshirazi, et al.

FAST problem is finding minimum feedback arc set problem in tournaments. In this paper we present some algorithms that are similar to sorting algorithms for FAST problem and we analyze them. We present Pseudo_InsertionSort algorithm for FAST problem and we show that average number of all backward edges in output of that is equal to ((n^2-5n+8)/4)-2^(1-n). We introduce Pseudo_MergeSort algorithm and we find the probability of being backward for an edge. Finally we introduce other algorithms for this problem.


page 1

page 2

page 3

page 4


Is this the simplest (and most surprising) sorting algorithm ever?

We present an extremely simple sorting algorithm. It may look like it is...

A Formalisation of Algorithms for Sorting Network

This notes explains how standard algorithms that construct sorting netwo...

Sorting wild pigs

Chjara, breeder in Cargèse, has n wild pigs. She would like to sort her ...

Fast geometric trim fitting using partial incremental sorting and accumulation

We present an algorithmic contribution to improve the efficiency of robu...

Defeating duplicates: A re-design of the LearnedSort algorithm

LearnedSort is a novel sorting algorithm that, unlike traditional method...

Efficient Stepwise Selection in Decomposable Models

In this paper, we present an efficient way of performing stepwise select...

Fast Sorting Algorithms using AVX-512 on Intel Knights Landing

This paper describes fast sorting techniques using the recent AVX-512 in...