Skip to main navigation menu Skip to main content Skip to site footer
×
Español (España) | English
Editorial
Home
Indexing
Original

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

By
S. Muthusundari ,
S. Muthusundari

Associate Professor, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
V. Devi ,
V. Devi

Assistant Professor, Department of CSE, Hindustan College of Engineering and Technology Coimbatore, India

Search this author on:

PubMed | Google Scholar
S. Sharath Kumar ,
S. Sharath Kumar

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
D. Sudhish Reddy ,
D. Sudhish Reddy

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
Kannedari Uday Kiran ,
Kannedari Uday Kiran

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
Pulimi Hanith Sai Kumar Reddy ,
Pulimi Hanith Sai Kumar Reddy

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
Gosani Bhanu Sai Priya ,
Gosani Bhanu Sai Priya

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar
Katragunta Yagna Priya ,
Katragunta Yagna Priya

Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India

Search this author on:

PubMed | Google Scholar

Abstract

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).

How to Cite

1.
Muthusundari S, Devi V, Sharath Kumar S, Sudhish Reddy D, Kiran KU, Kumar Reddy PHS, Sai Priya GB, Priya KY. Stack sort – a new approach with sorting network and a buffer. Salud, Ciencia y Tecnología - Serie de Conferencias [Internet]. 2024 Jun. 14 [cited 2024 Jul. 19];3:898. Available from: https://conferencias.saludcyt.ar/index.php/sctconf/article/view/898

The article is distributed under the Creative Commons Attribution 4.0 License. Unless otherwise stated, associated published material is distributed under the same licence.

Article metrics

Google scholar: See link

Metrics

Metrics Loading ...

The statements, opinions and data contained in the journal are solely those of the individual authors and contributors and not of the publisher and the editor(s). We stay neutral with regard to jurisdictional claims in published maps and institutional affiliations.