THE BITWISE OPERATIONS RELATED TO A FAST SORTING ALGORITHM
Journal Title: International Journal of Advanced Computer Science & Applications - Year 2013, Vol 4, Issue 9
Abstract
In the work we discuss the benefit of using bitwise operations in programming. Some interesting examples in this respect have been shown. What is described in detail is an algorithm for sorting an integer array with the substantial use of the bitwise operations. Besides its correctness we strictly prove that the described algorithm works in time O(n). In the work during the realization of each of the examined algorithms we use the apparatus of the object-oriented programming with the syntax and the semantics of the programming language C++
Authors and Affiliations
Krasimir Yordzhev
Keywords
Related Articles
- EP ID EP162025
- DOI 10.14569/IJACSA.2013.040917
- Views 105
- Downloads 0
Devising a Secure Architecture of Internet of Everything (IoE) to Avoid the Data Exploitation in Cross Culture Communications
The communication infrastructure among various interconnected devices has revolutionized the process of collecting and sharing information. This evolutionary paradigm of collecting, storing and analyzing data streams is...
Towards Face Recognition Using Eigenface
This paper presents a face recognition system employing eigenface-based approach. The principal objective of this research is to extract feature vectors from images and to reduce the dimension of information. The method...
Studying Applicability Feasibility of OFDM in Upcoming 5G Network
Orthogonal frequency-division multiplexing (OFDM) is one of unbeatable multiplexing technique till date. However with increasing version of next generation mobile standards like 5G, the applicability of OFDM is quite que...
A New Approach for Enhancing the Quality of Medical Computerized Tomography Images
Computerized tomography (CT) images contribute immensely to medical research and diagnosis. However, due to degradative factors such as noise, low contrast, and blurring, CT images tend to be a degraded representation of...
Distributed Group Key Management with Cluster based Communication for Dynamic Peer Groups
Secure group communication is an increasingly popular research area having received much attention in recent years. Group key management is a fundamental building block for secure group communication systems. This paper...