Stack sort: a new approach with sorting network and a buffer

Knuth introduced the problem of stack sorting. Stack sorting was implemented by t stacks in series. In this paper, we propose a new dimension to stack sorting problem by introducing a stack with sorting network and a petty buffer. Instead of using t stacks in series, it helps to improve the performa...

Full description

Saved in:
Bibliographic Details
Published inSalud, Ciencia y Tecnología - Serie de Conferencias Vol. 3; p. 898
Main Authors Muthusundari, S., Devi, V., Sharath Kumar, S., Sudhish Reddy, D., Uday Kiran, Kannedari, Kumar Reddy, Pulimi Hanith Sai, Sai Priya, Gosani Bhanu, Yagna Priya, Katragunta
Format Journal Article
LanguageEnglish
Published 01.01.2024
Online AccessGet full text

Cover

More Information
Summary:Knuth introduced the problem of stack sorting. Stack sorting was implemented by t stacks in series. In this paper, we propose a new dimension to stack sorting problem by introducing a stack with sorting network and a petty buffer. Instead of using t stacks in series, it helps to improve the performance by avoiding shuffles the stack. The basic idea behind in this paper is to perform a stack sorting with a single stack, and to achieve greater performance. In this novel approach, 2 bit buffer is compared to stack and insert the element into stack in order to avoid multiple stack. The result shows the time complexity of the proposed algorithm is O (n)
ISSN:2953-4860
DOI:10.56294/sctconf2024898