INDEX SELECTION SORTING ALGORITHEM Vishweshwarayya C Hallur 1 Angadi Institute of Technology & Management, Belgaum Ramesh K 2 Assistant Professor Department Computer Science Karnatak University, Dharwad-580003 Basavaraj A Goudannavar 3 Department of P.G. Studies and Research in Computer Science Karnatak University, Dharwad-580003 Abstract: One of the most frequent operations performed on database is searching. To perform this operation we have different kinds of searching techniques. These all searching algorithms work only on data, which are previously sorted. An efficient algorithm is required to make searching algorithm fast and efficient. This paper presents a new sorting algorithm named as “Index Selection Sorting Algorithm (ISSA)”. This ISSA is designed to perform sorting quickly and easily and also efficient as existing algorithms in sorting. Key Words: Algorithm, Sorting, ISSA, Worst Case, Average Case, and Best Case. I. Introduction Using a computer to solve problem involves directing it on what step it must follow to get the problem to be solved. The step it must follow is called an algorithm. The common sorting algorithm can be divided into two classes by the difficulty of their algorithms. There is a direct correlation between the complexity and effectiveness of an algorithm [1]. The complexity of an algorithm generally written in the form of Big O(n) notation, where O represents the complexity of the algorithm and value n represents the size of the list. The two groups of sorting algorithm are O(n2), which includes bubble sort, insertion sort, selection sort, and shell sort. And O(n log(n)) which includes the heap sort, merge sort and quick sort[2]. Since the drastic advancement in computing, most of the research is done to solve the sorting problem, perhaps due to the complexity of solving it efficiently dispite its simple and familiar statement. It is always very difficult to say that one sorting technique is better than another. Performance of the various sorting algorithms depends upon the data being sorted. Sorting is used in most of the applications and there have been plenty of performance analyses [3][4]. There has been growing interest on enhancements to sorting algorithms that do not have an effect on their asymptotic complexity but rather tend to improve performance by enhancing data locality [2][3][5]. II. Proposed System In ISSA technique the first number will be compared with all the elements in the list, at the end of each pass selection of proper index of new list is done and then element is copied it to that position in the new list. And this step will be repeated for n number of times. International Journal of Engineering Research & Technology (IJERT) Vol. 1 Issue 5, July - 2012 ISSN: 2278-0181 1 www.ijert.org