Java implements simple bubble sort code
Jan 30, 2024 am 09:34 AM
The simplest code example of Java bubble sort
Bubble sort is a common sorting algorithm. Its basic idea is to compare and sum adjacent elements. Exchange to gradually adjust the sequence to be sorted into an ordered sequence. The following is a simple Java code example that demonstrates how to implement bubble sort:
public class BubbleSort {
public static void bubbleSort(int[] arr) {
int n = arr.length;
for (int i = 0; i < n - 1; i++) {
for (int j = 0; j < n - i - 1; j++) {
if (arr[j] > arr[j + 1]) {
int temp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = temp;
}
}
}
}
public static void main(String[] args) {
int[] arr = {64, 34, 25, 12, 22, 11, 90};
bubbleSort(arr);
System.out.println("排序后的數(shù)組：");
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i] + " ");
}
}
}In this example, we define a BubbleSort class, which contains a static method named bubbleSort. This method accepts an array of type int as a parameter and sorts the array using the bubble sort algorithm.
The core part of the algorithm is two nested for loops. The outer loop controls the number of rounds of comparison, and a total of n-1 rounds of comparison are required (n is the array length). The inner loop controls each round of compare and swap operations. We determine whether they need to swap positions by comparing the sizes of two adjacent elements. If the previous element is larger than the next element, swap their positions.
In the main method, we create an array arr to be sorted and call the bubbleSort method for sorting. Finally, we output the sorted array by looping over it.
The above is the simplest code example to implement bubble sort using Java. Although bubble sort is simple, it is less efficient for sorting larger-scale data, so more efficient sorting algorithms are often used in practical applications. But as an entry-level sorting algorithm, it still has important value in teaching and understanding.
The above is the detailed content of Java implements simple bubble sort code. For more information, please follow other related articles on the PHP Chinese website!
Hot AI Tools
Undress AI Tool
Undress images for free
Undresser.AI Undress
AI-powered app for creating realistic nude photos
AI Clothes Remover
Online AI tool for removing clothes from photos.
Clothoff.io
AI clothes remover
Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!
Hot Article
Hot Tools
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
How to access ET files
Feb 18, 2024 pm 08:46 PM
ET file is a very common file format, which is usually generated by the table editor in WPS software. Before getting into ET files, we can first understand what ET files are, and then discuss how to open and edit them. ET files are the file format of WPS spreadsheet software, similar to XLS or XLSX files in Microsoft Excel. WPS spreadsheet is a powerful spreadsheet software that provides Excel-like functions for data processing, data analysis and chart creation.
Java data structures and algorithms: in-depth explanation
May 08, 2024 pm 10:12 PM
Data structures and algorithms are the basis of Java development. This article deeply explores the key data structures (such as arrays, linked lists, trees, etc.) and algorithms (such as sorting, search, graph algorithms, etc.) in Java. These structures are illustrated through practical examples, including using arrays to store scores, linked lists to manage shopping lists, stacks to implement recursion, queues to synchronize threads, and trees and hash tables for fast search and authentication. Understanding these concepts allows you to write efficient and maintainable Java code.
Transform code with C++ function pointers: improve efficiency and reusability
Apr 29, 2024 pm 06:45 PM
Function pointer technology can improve code efficiency and reusability, specifically as follows: Improved efficiency: Using function pointers can reduce repeated code and optimize the calling process. Improve reusability: Function pointers allow the use of general functions to process different data, improving program reusability.
Analyze time complexity and space complexity in Go language
Mar 27, 2024 am 09:24 AM
Go is an increasingly popular programming language that is designed to be easy to write, easy to read, and easy to maintain, while also supporting advanced programming concepts. Time complexity and space complexity are important concepts in algorithm and data structure analysis. They measure the execution efficiency and memory size of a program. In this article, we will focus on analyzing the time complexity and space complexity in the Go language. Time Complexity Time complexity refers to the relationship between the execution time of an algorithm and the size of the problem. Time is usually expressed in Big O notation
How to implement bubble sort algorithm in C#
Sep 19, 2023 am 11:10 AM
How to implement the bubble sort algorithm in C# Bubble sort is a simple but effective sorting algorithm that arranges an array by comparing adjacent elements multiple times and exchanging positions. In this article, we will introduce how to implement the bubble sort algorithm using C# language and provide specific code examples. First, let us understand the basic principles of bubble sort. The algorithm starts from the first element of the array and compares it with the next element. If the current element is larger than the next element, swap their positions; if the current element is smaller than the next element, keep it
CS-Week 3
Apr 04, 2025 am 06:06 AM
Algorithms are the set of instructions to solve problems, and their execution speed and memory usage vary. In programming, many algorithms are based on data search and sorting. This article will introduce several data retrieval and sorting algorithms. Linear search assumes that there is an array [20,500,10,5,100,1,50] and needs to find the number 50. The linear search algorithm checks each element in the array one by one until the target value is found or the complete array is traversed. The algorithm flowchart is as follows: The pseudo-code for linear search is as follows: Check each element: If the target value is found: Return true Return false C language implementation: #include#includeintmain(void){i
Guide to writing a custom sorting algorithm for PHP arrays
Apr 27, 2024 pm 06:12 PM
How to write a custom PHP array sorting algorithm? Bubble sort: Sorts an array by comparing and exchanging adjacent elements. Selection sort: Select the smallest or largest element each time and swap it with the current position. Insertion sort: Insert elements one by one into the sorted part.
The use of char in mysql
Apr 27, 2024 am 09:09 AM
The CHAR data type is used to store fixed-length text data in MySQL, which can ensure data consistency and improve query performance. This type specifies the data length, between 0 and 255 characters, which is specified when the table is created and remains constant for all rows of the same column. For variable-length data, it is recommended to use the VARCHAR type.
