Improved Double Selection Sort using Algorithm

2017 ◽  
Vol 9 (02) ◽  
pp. 85-88
Author(s):  
Nirupma Pathak ◽  
Shubham Tiwari
Keyword(s):  
Programming Language ◽  
Sorting Algorithm ◽  
C Programming Language ◽  
Sorting Technique ◽  
C Programming ◽  
Execution Speed ◽  
Speed Up ◽  
Popular Language ◽  
Sort Algorithm ◽  
Selection Of

In this paper, we present the work regarding the selection sorting technique for double ended selection sort. This sorting algorithm is both theoretical and programmatically analysis show that the introduce advance selection sort algorithm which enhances the performance of selection sort. It is much faster than the selection sort because of its selection of minimum and maximum elements simultaneously. Advance selection sort algorithm possibility of enhancing execution speed up to 30%. Code for this algorithm is written in C programming Language. So easy to understand the concept of this sorting algorithm by everyone because C is the popular language. Results and discusion show a higher level of performance for the sorting algorithm. It can theoretically prove that the algorithm can reduce steps with the selection short and will improve N2 sorts toward NlogN sort.

Bubbling Sort Algorithm Application Based on C Programming Language

2013 ◽  
Vol 380-384 ◽  
pp. 1734-1737
Author(s):  
Xiang Ping Xiao
Keyword(s):  
Programming Language ◽  
Teaching Method ◽  
C Language ◽  
C Programming Language ◽  
Java Language ◽  
C Programming ◽  
Mathematical Thought ◽  
Sort Algorithm ◽  
International Status

As its international status, mastering C programming language is very important, for example the java language, popular and widely used at present, which has all kinds of connections with C programming language. In the C language, the bubbling sort, which has the knowledge of the cycle and array, has been seen as classic examples to explain, and also is used in a variety of computer exams. One important reason is the bubbling sort itself more classic; another is that it is not easy for students to grasp and understand the bubbling sort. This paper will explore a new teaching method--introduction of mathematical thought--to help students to understand and master the bubbling sort.

scholarly journals Abstracting Strings for Model Checking of C Programs

2020 ◽  
Vol 10 (21) ◽  
pp. 7853
Author(s):  
Henrich Lauko ◽  
Martina Olliaro ◽  
Agostino Cortesi ◽  
Petr Roc̆kai
Keyword(s):  
Programming Language ◽  
Software Verification ◽  
Model Checker ◽  
Shape Information ◽  
C Programs ◽  
C Programming Language ◽  
C Programming ◽  
Array Structure ◽  
Two Parameters ◽  
Selection Of

Data type abstraction plays a crucial role in software verification. In this paper, we introduce a domain for abstracting strings in the C programming language, where strings are managed as null-terminated arrays of characters. The new domain M-String is parametrized on an index (bound) domain and a character domain. By means of these different constituent domains, M-Strings captures shape information on the array structure as well as value information on the characters occurring in the string. By tuning these two parameters, M-String can be easily tailored for specific verification tasks, balancing precision against complexity. The concrete and the abstract semantics of basic operations on strings are carefully formalized, and soundness proofs are fully detailed. Moreover, for a selection of functions contained in the standard C library, we provide the semantics for character access and update, enabling an automatic lifting of arbitrary string-manipulating code into our new domain. An implementation of abstract operations is provided within a tool that automatically lifts existing programs into the M-String domain along with an explicit-state model checker. The accuracy of the proposed domain is experimentally evaluated on real-case test programs, showing that M-String can efficiently detect real-world bugs as well as to prove that program does not contain them after they are fixed.

scholarly journals Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran

2013 ◽  
Vol 4 (2) ◽  
pp. 1106
Author(s):  
Reina Reina ◽  
Josef Bernadi Gautama
Keyword(s):  
Pattern Matching ◽  
Programming Language ◽  
Process Time ◽  
Sorting Algorithm ◽  
Basic Algorithm ◽  
Matching Algorithm ◽  
C Programming Language ◽  
C Programming ◽  
Science Major ◽  
Fortran Programming Language

Sorting is a basic algorithm studied by students of computer science major. Sorting algorithm is the basis of other algorithms such as searching algorithm, pattern matching algorithm. Bubble sort is a popular basic sorting algorithm due to its easiness to be implemented. Besides bubble sort, there is insertion sort. It is lesspopular than bubble sort because it has more difficult algorithm. This paper discusses about process time between insertion sort and bubble sort with two kinds of data. First is randomized data, and the second is data of descending list. Comparison of process time has been done in two kinds of programming language that is C programming language and FORTRAN programming language. The result shows that bubble sort needs more time than insertion sort does.

scholarly journals Parallel programming technologies on computer complexes

2020 ◽  
Vol 30 (3) ◽  
pp. 28-33 ◽  
Author(s):  
S. A. Pryadko ◽  
A. Yu. Troshin ◽  
V. D. Kozlov ◽  
A. E. Ivanov
Keyword(s):  
Parallel Programming ◽  
Shared Memory ◽  
Programming Language ◽  
Operating Systems ◽  
Distributed Memory ◽  
Programming Models ◽  
Writing Programs ◽  
Advantages And Disadvantages ◽  
C Programming Language ◽  
C Programming

The article describes various options for speeding up calculations on computer systems. These features are closely related to the architecture of these complexes. The objective of this paper is to provide necessary information when selecting the capability for the speeding process of solving the computation problem. The main features implemented using the following models are described: programming in systems with shared memory, programming in systems with distributed memory, and programming on graphics accelerators (video cards). The basic concept, principles, advantages, and disadvantages of each of the considered programming models are described. All standards for writing programs described in the article can be used both on Linux and Windows operating systems. The required libraries are available and compatible with the C/C++ programming language. The article concludes with recommendations on the use of a particular technology, depending on the type of task to be solved.

Sign in / Sign up

Export Citation Format

Share Document