Abstract: In this paper, we present a specific task from the topic of sorting algorithms, where an array of non-repeating numeric data is sorted by direct positioning. Such a task arises frequently in ...

A kind of heap sorting method based on array sorting was proposed. Some advantages and disadvantages of it were discussed. It was compared with the traditional method of direct application. In the ...

Push_swap is a sorting algorithm implementation designed to efficiently sort numbers using two stacks and a fixed set of instructions (push, swap, rotate). It takes an unordered stack of integers as ...

You are given an array that contains each number between 1 $\dots$ $n$ exactly once. Your task is to collect the numbers from 1 to $n$ in increasing order. On each ...