Back to Search Start Over

Freeze Sorting Algorithm Based on Even-Odd Elements

Authors :
Surmeet Kaur
Sarvjeet Singh
Source :
IOSR Journal of Engineering. 4:18-23
Publication Year :
2014
Publisher :
IOSR Journals, 2014.

Abstract

An algorithm is basically term vital part of Operations Research Methodology. There are many algorithms related to sorting, basically it is the operation of logically arrangement of records or elements and it can be used for the numerically data or alphabetically data. Sorting operation implemented in the Data Structure to make efficient searching of elements. The Sorting Algorithm, having the swap, comparison and assignment operations related to the direct complexity of an algorithm. In proposed sorting algorithms we used strategy of selection of the elements i.e. we have the functions called as MinOddFunction(collect the minimum odd value of list) and MinEvenFunction(collect the minimum even valued from list), these functions collect the values from list and compare with each other and freeze it and so on till array is empty. This algorithm has the time complexity in the worst case is O(n^2), where n is the size of data being sorted. In this proposed paper, we will conclude the time complexity on the basis of number of iterations, comparisons, memory time and other factors.

Details

ISSN :
22503021 and 22788719
Volume :
4
Database :
OpenAIRE
Journal :
IOSR Journal of Engineering
Accession number :
edsair.doi...........95113f7de59d140631d050cb32d84313
Full Text :
https://doi.org/10.9790/3021-04361823