Flexi Sort Algorithm
Uthaya Vasanthan S1, Karthikeyan B2, Senthil Kumar M3

1Uthaya Vasanthan S, M.S III Year Student, SITE School, VIT University, Vellore, (Tamil Nadu), India.
2Karthikeyan B, M.S III Year Student,  SITE School, VIT University, Vellore, (Tamil Nadu), India.
3Senthil Kumar M, Assistant Professor, SITE School, VIT University, Vellore, (Tamil Nadu), India.
Manuscript received on 10 May 2013 | Revised Manuscript received on 18 May 2013 | Manuscript Published on 30 May 2013 | PP: 181-183 | Volume-2 Issue-6, May 2013 | Retrieval Number: F0832052613/13©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: The main objective of this project is to develop a sorting algorithm which forms an integral part of any domain, irrespective of the place in which the algorithm is used. And the scope of this system is not limited to a specific user group. Any user who wishes to perform sorting operation can make use of the system, given that the user has prior knowledge on basic computer and complier operation.
Keywords: Algorithm System Operation

Scope of the Article: VLSI Algorithms