SORTIE SORTING
Journal Title: International Journal of Engineering Sciences & Research Technology - Year 2015, Vol 4, Issue 4
Abstract
Almost all computers regularly sort data. Many different sorting algorithms have been proposed. It is known that no sort algorithm based on key comparisons can sort N keys in less than O (N log N) operations and that many perform O(N2 ) operations in the worst case . This paper is aimed at proposing a new sortie tree data structure, which can be used for the sorting of data. This algorithm that implements a sortie tree data structure is a non-comparative sorting algorithm.
Authors and Affiliations
Tannishk Sharma
Savitzky-Golay Filter Based Vertical Handoff between LTE and WIFI Network
Heterogeneous network is a network connecting computers and other devices with different operating systems. Wireless networking is becoming an increasingly important and popular way of providing global informatio...
SOIL ENZYMES AND CHARACTERISTICS
For understanding the structure and the functions of soil ecosystem, the analysis of soil microorganisms’ population and the factors affecting their activities are important. For this purpose, the soil enzymes: ar...
A TECHNICAL REVIEW OF PEAK TO AVERAGE POWER RATIO REDUCTION IN MIMO-OFDM
In this paper, detailed review of bit error rate (BER) and peak to average power ratio (PAPR) reduction in multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) and performance...
HYBRID ALGORITHM FOR PAGE RANKING IN INFORMATION RETRIEVAL SYSTEMS
Information Retrieval IR systems store a large volume of unstructured data and provide search results for a user query. The performance of the IR systems depends upon the relevancy of the search results with user q...
RESULT ANALYSIS OF FACIAL EXPRESSION RECOGNITION TECHNIQUES
Expression recognition possesses practically significant importance; it offers vast application prospects, such as user-friendly interface between people and machine, humanistic design of products, and an automati...