Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 4,578 papers for “selection sort”
2015
Abstract – Optimized Selection Sort Algorithm is a new sorting algorithm that has been developed to address the shortcomings of the current popular sorting algorithms. The goal of this research is to perform an extensive empirical analysis of Optimized
Cited by 0
Martin H. Weik · 2000
Cited by 0
SpringerReference · 2011
Cited by 0
Ramin Edjlal, Armin Edjlal, Tayebeh Moradi · 2011
Today implementation of sort leads to lower and easier order time. Our purpose in this article are trying to introduce an algorithm with lower cost of Bubble sort and nearly same as Selection sort. A way is in orderly inserting of elements in another array. Sort is an algorithm that arranges all elements of an array, orderly. This algorithm has sequential form. The order of Selection sort complexity is nearly least than Bubble sort.
Cited by 9
Wolfram Demonstrations Project · 2008
Cited by 0Open access
Muhammad Ezar Al Rivan · SHILAP Revista de lepidopterología · 2017
Ordering is one of the process done before doing data processing. The sorting algorithm has its own strengths and weaknesses. By taking strengths of each algorithm then combined can be a better algorithm. Quick Sort and Merge Sort are algorithms that divide the data into parts and each part divide again into sub-section until one element. Usually one element join with others and then sorted by. In this experiment data divide into parts that have size not more than threshold. This part then sorted by Insertion Sort, Bubble Sort and Selection Sort. This replacement process can be reduce time used to divide data into one element. Data size and data type may affect time so this experiment use 5 data sizes and 3 types of data. The algorithm dominates in experiment are Merge-Insertion Sort and Merge-Selection Sort.
Cited by 0Open access
Sahil Kumar, Prerna Singla · International Journal of Mathematical Sciences and Computing · 2019
One of the most important problems in computer science is the ordering of the data. Although sorting is a very old computer science problem, it still attracts a great deal of research. Usually, when we face a problem, we're concerned with finding the solution, then getting it out of our heads and into a text editor, white-board, or down on a piece of paper. Eventually, we start transforming that idea into code, and the code is pretty terrible the first time around. But at some point, once we've made it work and made it right, we find ourselves asking: Can I make it fast? Can I make it better? This paper presents an enhanced sorting algorithm which comprises of a combination of Bubble Sort, Selection Sort, and Counting Sort. The new algorithm is analyzed, implemented, tested, compared and the results were promising.
Cited by 2Open access
Mahrozi, Nanang, Faisal, Muhammad · Research Repository Universitas Islam Negeri Maulana Malik Ibrahim (University of Southampton) · 2023
Algoritma memainkan peran yang sangat penting dalam pengembangan perangkat lunak dan pemrograman. Banyak logika pemrograman telah dikembangkan untuk memahami konsep dasar algoritma, baik yang bersifat umum maupun yang bersifat khusus. Pemrosesan data berperan penting dalam pengurutan algoritma, khususnya dalam konteks selection sort (pengurutan dengan pemilihan) dan bubble sort (pengurutan gelembung). Kedua algoritma ini dirancang untuk mengurutkan data dengan tipe integer. Setiap jenis algoritma memiliki tingkat efektivitas yang berbeda. Efektivitas suatu algoritma dapat diukur berdasarkan waktu dan ruang memori yang dibutuhkan untuk mengeksekusinya. Algoritma yang efisien adalah algoritma yang dapat mengoptimalkan penggunaan waktu dan ruang secara minimal. Semakin sedikit sumber daya yang dibutuhkan untuk menjalankan algoritma, semakin efektif algoritma tersebut dianggap. Perlu diingat bahwa waktu dan ruang yang diperlukan oleh suatu algoritma dipengaruhi oleh Jumlah data yang diolah dan jenis algoritma yang diterapkan menjadi fokus utama dalam artikel ini, dengan penekanan pada kompleksitas waktu dari berbagai jenis algoritma. Algoritma-algoritma yang dijelaskan dalam penelitian ini diimplementasikan dengan menggunakan bahasa pemrograman python dalam lingkungan google colab. Mengacu pada logika dari proses pengurutan data menggunakan algoritma seperti Selection Sort dan Bubble Sort dapat disimpulkan bahwa algoritma selection sort memiliki keunggulan kecepatan dibanding buble sort, terbukti dari pengujian 100-100000 data selection sort selalu lebih cepat.
Cited by 0Open access
Pramod Ganapathi, Rezaul Chowdhury · The Computer Journal · 2021
Abstract We present efficient parallel recursive divide-and-conquer algorithms for bubble sort, selection sort, and insertion sort. Our algorithms have excellent data locality and are highly parallel. The computational complexity of our insertion sort is ${{\mathcal{O}}}\left ({n^{\log _2 3}}\right )$ in contrast to ${{\mathcal{O}}}\left ({n^2}\right )$ of standard insertion sort.
Cited by 7
Tri Dharma Putra, Rakhmat Purnomo · Jurnal Sistem Komputer dan Informatika (JSON) · 2025
The purpose of this study is to analyze the comparison of sorting algorithms. Searching algorithm is a main issue in computer science. Many algorithms have been presented by experts. The main issue is the efficiency of these algorithms. Sorting a large number of data will create time issues. Time needed to sort the data is very crucial in this context. Many sorting algorithms are in the field. Two of them are selection sort and exchange sort algorithms. These two are a popular algorithm in data structure. Exchange sort algorithm is very similar to Bubble Sort. Many say Bubble Sort is the same as Exchange Sort. The difference is in how it compares elements. Exchange sort compares one element to the other elements in the array and swaps elements if necessary. Selection sort algorithm is a combination of sorting and searching. For each process, comparison and theoretical analysis is given. The unsorted elements with the smallest or largest values are searched for and exchanged to their appropriate positions within the array. In the comparison and theoretical analysis 1, it was conducted by hand and we got the numbers to be descending from 11, 23, 30, 39, 41, 51 to be 51, 41, 39, 30, 23, 11. For the comparison and theoretical analysis 2, we got the numbers to be descending from 1, 22, 10, 9, 42, 26 to be 42, 26, 22, 10, 9, 1. The most swap happened in exchange sort of comparison and theoretical analysis 1 with 14 swaps, in the second exchange sort it is only 11 swaps. The research gap is about stages of processes algorithm with methodology systematic literature review. The stages of systematic literature review is presented which is planning, conducting literature search, and reporting. PRISMA flow chart is also presented. a visual representation of the article selection process. This diagram illustrates four main stages: Identification, Screening, Eligibility, Inclusion.
Cited by 0Open access
Nirupma Pathak, Shubham Tiwari · SAMRIDDHI A Journal of Physical Sciences Engineering and Technology · 2017
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.
Cited by 1Open access
F.H. Murphy, Edward A. Stohr · 1977
Cited by 0
Dusso, Pedro Martins · 2015
Cited by 0Open access
Rakhmat Purnomo, Tri Dharma Putra · SinkrOn · 2023
Sorting algorithms plays an important role in the computer science field. Many applications use sorting algorithm. There are several sorting algorithms proposed by experts, namely bubble sort, exchange short, insertion short, heap sort, quick short, merge sort, standard selection sort. One well-known algorithm of sorting is selection sort. In this journal, discussion about standard selection sort is given with thorough analysis. Sorting is very important data structure concepts that has an important role in memory management, file management, in computer science in general, and in many real-life applications. Different sorting algorithms have differences in terms of time complexity, memory use, efficiency, and other factors. There are many sorting algorithms exist right now in the computer science field. Each algorithm has its benefits and limitations where a trade-off exists between execution time and the nature of the complexity of the algorithm itself. The method is theoretical analysis. Three theoretical analyses are given with deep explanation and analysis. Each with six index arrays, namely with six data on it. The numbers are sorted in ascending order. Pseudo code is also given, to understand this algorithm more thoroughly. It is concluded that this theoretical analysis explained the algorithm more clearly, by using process iteration by hand.
Cited by 0Open access
Indah Purnama Sari, Al-Khowarizmi Al-Khowarizmi, Fanny Ramadhani et al. · Journal of Computer Science Information Technology and Telecommunication Engineering · 2023
The role of algorithms in software or programming is very important, so it is necessary to understand the basic concept of the algorithm. The sorting algorithm is, selection sort (sorting by selecting) is the process of sorting data according to certain rules so that they are ordered regularly. Sorting data consisting of some criteria have priority where the data is sorted by language PHP programming that provides the sort function to sort array data in ascending or descending order from smallest to largest. The sort function is sort data from smallest to largest digit or last letter of letters first each word prioritizes letters then numbers if the data is in that table data consists of a mixture of numbers and letters. The method used is searching the smallest element of the array and swaps it with the element in the first position, then this algorithm repeats the same thing again, namely looking for elements in second position, The process that will result from this system continues until all array elements successfully sorted.
Cited by 27Open access
Risqi Pradana Aryanto, Agung Nilogiri, Ari Eko Wardoyo · EDUMATIC Jurnal Pendidikan Informatika · 2023
Sorting algorithms are crucial in data processing, particularly for integer data. However, as the number of integers to be sorted increases, the sorting algorithm takes longer to complete, especially for algorithms with O(n2) complexity. This article discusses optimizing integer data sorting by combining the Selection Sort Hybrid and Bucket Sort algorithms. The study aims to test the performance of the Selection Sort Hybrid and Bucket Sort algorithms and compare them with other data sorting algorithms. The research method used is experimental quantitative research, using randomly generated data using Python. The data were tested using the Combined Selection Sort Hybrid with Bucket Sort algorithm, Selection Sort Hybrid, Quick Sort, and Merge Sort. Data analysis was done by calculating the execution time of each sorting algorithm. The results show that the Selection Sort Hybrid and Bucket Sort algorithms are faster than other sorting algorithms in testing with large and complex integer data. Therefore, combining Selection Sort Hybrid and Bucket Sort algorithms can improve the efficiency and speed of sorting complex integer data.
Cited by 1Open access
Sultanullah Jadoon, Salman Faiz Solehria, Prof Dr et al. · 2011
Abstract — One of the most frequent operation performed on database is searching. To perform this operation we have different kinds of searching algorithms, some of which are Binary Search, Index Sequential Access Method (ISAM), but these and all other searching algorithms work only on data, which are previously sorted. An efficient algorithm is required in order to make the searching algorithm fast and efficient. This research paper presents a new sorting algorithm named as “Optimized Selection Sort Algorithm, OSSA”.OSSA is designed to perform sorting quickly and more effectively as compared to the existing version of selection sort. The introduction of OSSA version of selection sort algorithm for sorting the data stored in database instead of existing selection sort algorithm will provide an opportunity to the users to save almost 50 % of their operation time with almost 100 % accuracy.
Cited by 0
Manish Kumar, Ms. Monika Malhotra, Ms. Deepali Ahuja · International Journal Of Engineering And Computer Science · 2017
Cited by 0
K. Kavitha · 2018
Cited by 2
Sultan Ullah, Muhammad Aamir Khan, Mudasser Ali Khan et al. · 2015
The main idea of Optimized Selection Sort Algorithm (OSSA) is based on the already existing selection sort algorithm, with a difference that old selection sort; sorts one element either smallest or largest in a single iteration while optimized selection sort, sorts both the elements at the same time i.e smallest and largest in a single iteration. In this study we have developed a variation of OSSA for two-dimensional array and called it Optimized Selection Sort Algorithms for Two-Dimensional arrays OSSA2D. The hypothetical and experimental analysis revealed that the implementation of the proposed algorithm is easy. The comparison shows that the performance of OSSA2D is better than OSSA by four times and when compared with old Selection Sort algorithm the performance is improved by eight times (i.e if OSSA can sort an array in 100 seconds, OSSA2D can sort it in 24.55 Seconds, and similarly if Selection Sort takes 100 Seconds then OSSA2D take only 12.22 Seconds). This performance is remarkable when the array size is very large. The experiential results also demonstrate that the proposed algorithm has much lower computational complexity than the one dimensional sorting algorithm when the array size is very large.
Cited by 3