RVA Sorting Based On Bubble & Quick Sort Technique
Ramander Singh, Vinod Kumar, Ankur Kumar Shrivastava, Shailendra Kumar Rai, Amod Kumar Tiwari · 2014
In the new era of computer science, sorting algorithm is an efficient algorithm which performs an important task that place elements of a list in some order or arrange a set of items into a specific order. Sorting data has been developed to arrange the list values in various ways for a database. For example, sorting will order a list of values from lowest to highest or from highest to lowest, or arrange the list of strings into alphabetical order. Basically, it sorts a list of items into increasing or decreasing order. Sorting is important to optimize the use of other algorithms such as binary search. We are proposing a technique or an algorithm(named RVA Sort) which is used to sort the given list of item in an efficient or less time comparison to others existing algorithm. RVA Sort is a hybrid sorting algorithm, derived from Bubble and Quick Sort designed to perform well on many kinds of data.