Associate Professor, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Assistant Professor, Department of CSE, Hindustan College of Engineering and Technology Coimbatore, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
Student, Department of CSE, R.M.D. Engineering College, Kavaraipettai, Tamil Nadu, India
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).
The article is distributed under the Creative Commons Attribution 4.0 License. Unless otherwise stated, associated published material is distributed under the same licence.
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.