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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

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

Apply Sorting Algorithms to FAST Problem