🎓 Top 15 Udemy Courses (80-90% Discount): My Udemy Courses - Ramesh Fadatare — All my Udemy courses are real-time and project oriented courses.
▶️ Subscribe to My YouTube Channel (178K+ subscribers): Java Guides on YouTube
▶️ For AI, ChatGPT, Web, Tech, and Generative AI, subscribe to another channel: Ramesh Fadatare on YouTube
1. Introduction
Bubble Sort is one of the simplest sorting algorithms. The basic idea is to repeatedly step through the list, compare adjacent elements, and swap them if they are in the wrong order. The algorithm gets its name because with each complete pass, the largest element "bubbles" to its correct position at the end of the list. In this guide, we will implement the Bubble Sort algorithm in R.
2. Program Overview
The program will:
1. Define a function for the Bubble Sort algorithm.
2. Create a vector with a series of numbers.
3. Use the Bubble Sort function to sort the vector.
4. Display the sorted vector.
3. Code Program
# Define the Bubble Sort function
bubbleSort <- function(vec) {
n <- length(vec)
# Outer loop for passes
for (i in 1:(n-1)) {
# Inner loop for comparing adjacent elements
for (j in 1:(n-i)) {
# Swap if the elements are in the wrong order
if (vec[j] > vec[j+1]) {
temp <- vec[j]
vec[j] <- vec[j+1]
vec[j+1] <- temp
}
}
}
# Return the sorted vector
return(vec)
}
# Create a vector
numbers <- c(56, 12, 89, 45, 23, 24)
# Sort the vector using Bubble Sort
sorted_numbers <- bubbleSort(numbers)
# Display the sorted vector
cat("Sorted vector using Bubble Sort:", sorted_numbers, "\n")
Output:
Sorted vector using Bubble Sort: 12 23 24 45 56 89
4. Step By Step Explanation
1. We start by defining the bubbleSort function. This function takes a vector as its input and sorts it using the Bubble Sort algorithm.
2. The length of the vector is determined using the length function.
3. The outer loop represents the number of passes required to sort the entire list. The inner loop is where the adjacent element comparisons and possible swaps occur.
4. Within the inner loop, if an element vec[j] is greater than its adjacent element vec[j+1], we swap them. This ensures that at the end of each pass, the largest unsorted element "bubbles up" to its correct position.
5. After the sorting is complete, the function returns the sorted vector.
6. We then create a vector called "numbers" and use the bubbleSort function to sort it.
7. Lastly, the sorted vector is displayed using the cat function.
My Top and Bestseller Udemy Courses. The sale is going on with a 70 - 80% discount. The discount coupon has been added to each course below:
Build REST APIs with Spring Boot 4, Spring Security 7, and JWT
![[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25](https://img-c.udemycdn.com/course/750x422/6852721_b512_2.jpg "[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25")
[NEW] Learn Apache Maven with IntelliJ IDEA and Java 25
ChatGPT + Generative AI + Prompt Engineering for Beginners
Spring 7 and Spring Boot 4 for Beginners (Includes 8 Projects)
Available in Udemy for Business
Building Real-Time REST APIs with Spring Boot - Blog App
Available in Udemy for Business
Building Microservices with Spring Boot and Spring Cloud
Available in Udemy for Business
Java Full-Stack Developer Course with Spring Boot and React JS
Available in Udemy for Business
Build 5 Spring Boot Projects with Java: Line-by-Line Coding
Testing Spring Boot Application with JUnit and Mockito
Available in Udemy for Business
Spring Boot Thymeleaf Real-Time Web Application - Blog App
Available in Udemy for Business
Master Spring Data JPA with Hibernate
Available in Udemy for Business
Spring Boot + Apache Kafka Course - The Practical Guide
Available in Udemy for Business
Comments
Post a Comment
Leave Comment