English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

Sorting algorithms usually generate strictly descending sequences. However, almost descending sequences may be sufficient to fulfill our needs in practice, and the number of movements needed for generating such sequences can be greatly reduced. We call a sequence <inline-formula> <tex-math notation="LaTeX">$S$ </tex-math></inline-formula> almost descending if <inline-formula> <tex-math notation="LaTeX">$S[j]-S[i]< C$ </tex-math></inline-formula> for any <inline-formula> <tex-math notation="LaTeX">$i< j$ </tex-math></inline-formula> and a positive number <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula>, which depends on the practical circumstances. Unless the difference between <inline-formula> <tex-math notation="LaTeX">$S[j]$ </tex-math></inline-formula> and <inline-formula> <tex-math notation="LaTeX">$S[i]$ </tex-math></inline-formula> exceeds the bound <inline-formula> <tex-math notation="LaTeX">$C$ </tex-math></inline-formula>, we deem them indistinguishable. For example, when people are arranged in a line from tall to short, two people with heights of 1.751 meters and 1.752 meters can be considered visually indistinguishable (we can set the bound to <inline-formula> <tex-math notation="LaTeX">$C=0.005$ </tex-math></inline-formula> meters in this case). Therefore, we do not need to adjust their positions, which leads to fewer movements in sorting. In this paper, three algorithms are provided to generate almost descending sequences, and their correctness is proven. The experimental results of the proposed algorithms demonstrate that our technique can reduce the number of movements in sorting. In addition, almost descending sequences are more stable than strictly descending sequences in dynamic sorting, which is useful in online sorting and sorting in noisy environments.

Generating Almost Descending Sequences to Reduce the Number of Movements in Sorting