Academic literature on the topic 'Bubble sort algorithm'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bubble sort algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bubble sort algorithm"

1

Reina, Reina, and Josef Bernadi Gautama. "Perbandingan Bubble Sort dengan Insertion Sort pada Bahasa Pemrograman C dan Fortran." ComTech: Computer, Mathematics and Engineering Applications 4, no. 2 (2013): 1106. http://dx.doi.org/10.21512/comtech.v4i2.2553.

Full text
Abstract:
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 bee
APA, Harvard, Vancouver, ISO, and other styles
2

Bustami, Bustami, Fadlisyah Fadlisyah, and Gusti Alfyansyah. "COMPARISON OF SIMPLE ALGORITHM DATA (SORTING) CONTROL METHODS ON SELECTION AND BUBBLE SORT." TECHSI - Jurnal Teknik Informatika 11, no. 2 (2019): 289. http://dx.doi.org/10.29103/techsi.v11i2.1601.

Full text
Abstract:
In the data there is a sorting process which is sorting data with certain rules, so that it will be arranged in the algorithm. Algorithms are steps that will solve a problem in the data, algorithms have a variety of settlement methods, one of which is the sorting method. Data sorting (Sorting) contains different types such as Bubble Sort, Insertion Sort, Merge Sort, Quick Sort, Selection Sort, and Shell Sort. The following will explain how to process the data sequencing of each method using a simple algorithm, especially in the Selection Sort method, and Bubble Sort. Keywords: Algorithm, Bubbl
APA, Harvard, Vancouver, ISO, and other styles
3

Singh, Jasrat. "Advanced Optimization of Fundamental Searching and Sorting Algorithms." International Journal of Advance Research and Innovation 2, no. 2 (2014): 29–42. http://dx.doi.org/10.51976/ijari.221405.

Full text
Abstract:
Searching and Sorting are the most important data structure operations, which make easy searching, arranging and locating the information. One of the basic problems of computer science is sorting a list of items and searching elements in the array. There are a number of solutions to these problems, known as sorting algorithm, and searching algorithm. Some searching algorithms are simple and spontaneous, such as the Linear Search, Binary Search. All searching algorithms are problem specific meaning they work well on some specific problem and do not work well for all the problems, therefore, app
APA, Harvard, Vancouver, ISO, and other styles
4

Sunandar, Endang. "Implementation Of Bubble Sort Algorithm On 2 Fruit Models Of Data Selection Using The Java Program Language." Petir 14, no. 2 (2021): 159–69. http://dx.doi.org/10.33322/petir.v14i2.946.

Full text
Abstract:
There are various kinds of data sorting methods that we know of which are the Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Shell Sort, Heap Sort, and Radix Sort methods. All of these methods have advantages and disadvantages of each, whose use is determined based on needs. Each method has a different algorithm, where different algorithms affect the execution time. One interesting algorithm to be implemented on 2 variant models of data sorting is the Bubble Sort algorithm, the reason is that this algorithm has a fairly long and detailed process flow to produce an ordered data sequen
APA, Harvard, Vancouver, ISO, and other styles
5

Appiah, Obed, and Ezekiel Mensah Martey. "Magnetic Bubble Sort Algorithm." International Journal of Computer Applications 122, no. 21 (2015): 24–28. http://dx.doi.org/10.5120/21850-5168.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Agrahari, Aaryan, Pratik Dawkhar, Harsh Jadhav, Hamza Sayyad, and Deepa Athawale. "SortPath Visual Studio." INTERANTIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 03 (2025): 1–9. https://doi.org/10.55041/ijsrem43430.

Full text
Abstract:
“SortPath Visual Studio” is an interactive algorithm visualization platform designed to help students to understand complex sorting and pathfinding algorithms through real-time visual representation. The system features two user roles: Teacher and Student. Students can explore sorting and pathfinding visualizers, each supporting multiple algorithms. Bubble Sort, Selection Sort, Insertion Sort, Merge Sort, Quick Sort, and Heap Sort are few of the features of the sorting visualizer offering input size, speed, and node visualisation choices. Pathfinding visualiser offers BFS, DFS, A*, and Dijkstr
APA, Harvard, Vancouver, ISO, and other styles
7

Purnomo, Dwi Marhaendro Jati, Ahmad Arinaldi, Dwi Teguh Priyantini, Ari Wibisono, and Andreas Febrian. "IMPLEMENTATION OF SERIAL AND PARALLEL BUBBLE SORT ON FPGA." Jurnal Ilmu Komputer dan Informasi 9, no. 2 (2016): 113. http://dx.doi.org/10.21609/jiki.v9i2.378.

Full text
Abstract:
Sorting is common process in computational world. Its utilization are on many fields from research to industry. There are many sorting algorithm in nowadays. One of the simplest yet powerful is bubble sort. In this study, bubble sort is implemented on FPGA. The implementation was taken on serial and parallel approach. Serial and parallel bubble sort then compared by means of its memory, execution time, and utility which comprises slices and LUTs. The experiments show that serial bubble sort required smaller memory as well as utility compared to parallel bubble sort. Meanwhile, parallel bubble
APA, Harvard, Vancouver, ISO, and other styles
8

Khalid Imam Rahmani, Mohammad. "Smart Bubble Sort: A Novel and Dynamic Variant of Bubble Sort Algorithm." Computers, Materials & Continua 71, no. 3 (2022): 4895–913. http://dx.doi.org/10.32604/cmc.2022.023837.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Saputri Saputri and Yahfizham Yahfizham. "Analisis Study Komperatif Bubble Sort Dan Selection Sort Pada Algoritma Dan Pemograman Berdasarkan Seleksi Pengurutan." Jurnal Arjuna : Publikasi Ilmu Pendidikan, Bahasa dan Matematika 1, no. 6 (2023): 151–61. http://dx.doi.org/10.61132/arjuna.v1i6.305.

Full text
Abstract:
Technological developments that continue to develop have an influence on the increasing number of data, making it a complicated problem to solve manually. The existence of programming algorithms is a solution in completing the data management process, so that errors do not occur in providing answers to data management results, so that the information provided is more accurate and reliable. Besides that, many sorting algorithms are used as solutions to various problems. The use of this algorithm takes into account various aspects of the problem to be solved. Therefore, first find out the compar
APA, Harvard, Vancouver, ISO, and other styles
10

Htwe, Htwe Aung. "Analysis and Comparative of Sorting Algorithms." International Journal of Trend in Scientific Research and Development 3, no. 5 (2019): 1049–53. https://doi.org/10.5281/zenodo.3590516.

Full text
Abstract:
There are many popular problems in different practical fields of computer sciences, computer networks, database applications and artificial intelligence. One of these basic operations and problems is the sorting algorithm. Sorting is also a fundamental problem in algorithm analysis and designing point of view. Therefore, many computer scientists have much worked on sorting algorithms. Sorting is a key data structure operation, which makes easy arranging, searching, and finding the information. Sorting of elements is an important task in computation that is used frequently in different processe
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Bubble sort algorithm"

1

Carrieri, Angela. "Algoritmi di ordinamento e permutazioni a motivo escluso." Bachelor's thesis, Alma Mater Studiorum - Università di Bologna, 2019. http://amslaurea.unibo.it/19211/.

Full text
Abstract:
In questa Tesi vengono analizzati due algoritmi di ordinamento di liste di numeri distinti: quello tramite pile e quello a bolla, e la loro relazione con le permutazioni a motivo escluso. Inizialmente viene descritto l'algoritmo di ordinamento tramite una sola pila e successivamente si fa un discorso più generale sull'ordinamento tramite più di una pila. Infine, si descrive l'algoritmo Bubble Sort e la sua variante Cocktail Sort.
APA, Harvard, Vancouver, ISO, and other styles
2

Suchaževskaja, Tatjana. "Dinaminės duomenų struktūros ir kai kurių jų algoritmų realizavimas rodyklėmis." Master's thesis, Lithuanian Academic Libraries Network (LABT), 2005. http://vddb.library.lt/obj/LT-eLABa-0001:E.02~2005~D_20050608_172624-42734.

Full text
Abstract:
The present research paper deals with the comparison of static and dynamic data structures: static array, dynamic array, pointers array - class TList (Delphi) and dynamic doubly linked list, created with the help of recursive record.To compare the above mentioned structures, sorting (Bubble) and convex hull creation algorithms (Graham, Endrew) are realized, with the time of their implementation analysed. The algorithm of sorting (Bubble) is realized by four ways: static array, dynamic array, pointers array (class TList) and a dynamic doubly linked list, created with the help of recursive recor
APA, Harvard, Vancouver, ISO, and other styles
3

Chen, Yung-Chu, and 陳勇竹. "Using Bubble sort and Nearest Neighbor Algorithm to Identify the Flood Zone." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/cequsd.

Full text
Abstract:
碩士<br>國立臺北科技大學<br>土木工程系土木與防災碩士班<br>105<br>Taiwan is located in subtropical regions, Taiwan has abundant rainfall in the rainy season. In August and September due to the tropical ocean and the air temperature, In addition to Taiwan caused by Typhoon brings heavy rainfall, Excess rainfall results in the low-lying areas have depression storage. If the rainfall intensity is strong and concentrated, could trigger more floods, In this masters thesis, Mainly for the study of flooding. Because the current flooding system are generally more meticulous, which is spend a lot of times. That is hard to us
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Bubble sort algorithm"

1

Erickson, Kristin. Performing Algorithms. Edited by Roger T. Dean and Alex McLean. Oxford University Press, 2018. http://dx.doi.org/10.1093/oxfordhb/9780190226992.013.32.

Full text
Abstract:
The chapter considers algorithmic music as the ‘sonification’ of algorithms, a term coined by Carla Scaletti to describe the mapping of numerically represented relations in some domain to relations in an acoustic domain. The chapter looks at the range of ways this concept has been used by the author in composing her works. The chapter identifies isomorphic relationships between algorithms and collaboration, music, and performance, and extends the boundary of the computer to include systems of people and sound. The definition of music and performance is extended to include process, rules, machi
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Bubble sort algorithm"

1

Yu, Ping, You Yang, and Yan Gan. "Experiment Analysis on the Bubble Sort Algorithm and Its Improved Algorithms." In Lecture Notes in Electrical Engineering. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-2386-6_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Li, Lin, and SuJuan Rui. "Experiment Analysis on the Bubble Sort Algorithm and Its Improved Algorithms." In Lecture Notes in Electrical Engineering. Springer London, 2012. http://dx.doi.org/10.1007/978-1-4471-2386-6_4.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kao, Shih-Shun, Ralf Klasing, Ling-Ju Hung, and Sun-Yuan Hsieh. "A Parallel Algorithm for Constructing Multiple Independent Spanning Trees in Bubble-Sort Networks." In Algorithmic Aspects in Information and Management. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-93176-6_22.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Lee, HyeongOk, Hyun Sim, JungHyun Seo, and Mihye Kim. "Embedding Algorithms for Bubble-Sort, Macro-star, and Transposition Graphs." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-15672-4_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Kim, Mihye, Dongwan Kim, and Hyeongok Lee. "Embedding Algorithms for Star, Bubble-Sort, Rotator-Faber-Moore, and Pancake Graphs." In Algorithms and Architectures for Parallel Processing. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-13136-3_36.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sharma, Monu, Amit Dhiman, Ms Nitya, Mr Shubneet, and Anushka Raj Yadav. "DATA STRUCTURES AND ALGORITHMS." In Intelligent Shields: Artificial Intelligence and Machine Learning for Cybersecurity. Iterative International Publishers (IIP), Selfypage Developers Pvt Ltd., 2025. https://doi.org/10.58532/nbennurasai6.

Full text
Abstract:
Data structures and algorithms serve as the cornerstone of efficient computational problemsolving, enabling the organization and manipulation of data with optimal resource utilization. This chapter delves into foundational data structures, including arrays, linked lists, stacks, queues, and trees, alongside critical algorithms for sorting (e.g., quicksort, bubble sort) and searching (e.g., binary search). Theoretical principles such as time/space complexity analysis and memory management are examined to underscore their impact on algorithmic efficiency [1, 2]. Practical applications—such as hash tables for database indexing and graph algorithms for social network analysis—illustrate the real-world relevance of these concepts [3, 4]. Visual aids, including memory diagrams for linked lists and recursion call stacks, clarify intricate operations and enhance conceptual understanding. By bridging abstract data types with concrete implementations, the chapter equips readers to design scalable solutions for complex computational challenges.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bubble sort algorithm"

1

Han, Yuxuan, Jianqiao Xiong, Zongrong Wang, Ming Li, and Yifan Wu. "Research on Multi-direction N-RGVs (N-Rail Guided Vehicles) Scheduling System Based on Bubble Sort Algorithm." In 2024 6th International Conference on Robotics, Intelligent Control and Artificial Intelligence (RICAI). IEEE, 2024. https://doi.org/10.1109/ricai64321.2024.10911608.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Min, Wang. "Analysis on Bubble Sort Algorithm Optimization." In 2010 International Forum on Information Technology and Applications (IFITA). IEEE, 2010. http://dx.doi.org/10.1109/ifita.2010.9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Singhal, R., Gwan Choi, and R. N. Mahapatra. "Programmable LDPC decoder based on the bubble-sort algorithm." In 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (VLSID'06). IEEE, 2006. http://dx.doi.org/10.1109/vlsid.2006.137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Paul, Tithi. "Enhancement of Bubble and Insertion Sort Algorithm Using Block Partitioning." In 2022 25th International Conference on Computer and Information Technology (ICCIT). IEEE, 2022. http://dx.doi.org/10.1109/iccit57492.2022.10055404.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Panigrahi, Sunil Kumar, Soubhik Chakraborty, and Jibitesh Mishra. "Statistical bound of bubble sort algorithm in serial and parallel computations." In 2015 International Conference on Electrical, Electronics, Signals, Communication and Optimization (EESCO). IEEE, 2015. http://dx.doi.org/10.1109/eesco.2015.7253812.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Lipu, Ashrak Rahman, Ruhul Amin, Md Nazrul Islam Mondal, and Md Al Mamun. "Exploiting parallelism for faster implementation of Bubble sort algorithm using FPGA." In 2016 2nd International Conference on Electrical, Computer & Telecommunication Engineering (ICECTE). IEEE, 2016. http://dx.doi.org/10.1109/icecte.2016.7879576.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Bellstrom, Peter, and Claes Thoren. "Learning how to program through visualization: A pilot study on the Bubble Sort algorithm." In 2009 Second International Conference on the Applications of Digital Information and Web Technologies (ICADIWT). IEEE, 2009. http://dx.doi.org/10.1109/icadiwt.2009.5273943.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Lee, Hyeongok. "Design of new routing algorithm and embedding for Hierarchical Hypercube Networks." In AHFE 2023 Hawaii Edition. AHFE International, 2023. http://dx.doi.org/10.54941/ahfe1004204.

Full text
Abstract:
Mesh, hypercube, HHN, bubbls-sort, star, transposition, and macro-star graphs have been proposed as interconnection networks used in high-performance parallel computer structures. A hypercube expresses a node with n binary numbers, and has an edge between 1-bit other nodes. A hypercube is an excellent network from a graph-theoretic point of view, such as node symmetry, fault tolerance, recursive scalability, and Hamiltonian cycles. However, compared to the increase in the number of nodes, the number of edges increases proportionally, so the network cost is not good. The HHN graph was proposed
APA, Harvard, Vancouver, ISO, and other styles
9

Zhao, Tao, Philip Cooper, and Joost Brugmans. "Deepwater Rigid Spools Slugging Flow Fatigue Design." In ASME 2010 29th International Conference on Ocean, Offshore and Arctic Engineering. ASMEDC, 2010. http://dx.doi.org/10.1115/omae2010-20469.

Full text
Abstract:
Tie-in spools form an important part of any deepwater flowline system. Successful designs have the potential to deliver significant savings in fabrication, transportation and installation costs, whilst protecting project schedules. For multiphase flowlines, slug-induced fatigue damage has emerged as a governing design criterion in recent projects. Spans have become the focus of attention for slug-induced fatigue damage. These may occur at tie-in spools used to connect flowlines in deepwater developments. Conventional piping design software tools are commonly used for rigid spools design. Limit
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!