Java Program to Bitonic Sort

1. Overview

In this article, We'll learn about how to implement Bitonic sort in java.

Bitonic Sort is a classic parallel sorting algorithm. This is called as Bitonic Mergesort. It is also used as a construction method for building a sorting network.

Basically, it is a procedure of Biotonic sequence using bitonic splits.

How to write optimized bubble sort in java?

In java many sorting techniques can be implemented. But we have to choose the better one. This is very rarely used in real applications.

The bitonic sequence is said that when there is an index i exists such that either monotonically increasing and monotonically decreasing from index i and vice versa.

Eg. 7, 4, 2, 1, 9, 8, 7, 6, 5

Selection Sort in java with Algorithm, Example

Selection Sort in java

In this tutorial, We will learn about another sorting technique where auxiliary space is minimized. As of now we have discussed about the following

Implementation of Bubble Sort
Implementation of Optimized Bubble Sort
Implementation of Insertion Sort
Several Java Example programs

In computer science, selection sort is a sorting algorithm, Selection sort works from left to right typically. It finds the smallest element index and its swap with the current indexed element.

It is specifically an in-place comparison sort. It has O(n2) time complexity and worst than Insertion sort and better than Bubble sort.

Java Program to Optimized Bubble Sort With Examples

1. Optimized Bubble Sort in Java

In this post, we will learn how to optimize the bubble sort algorithm. This is a very basic interview question in many product-based companies for freshers and 0-2 experience.

Of course, Bubble Sort is one of the slowest algorithms but still, we can optimize it for better performance and this is only for smaller sets of input.

If you do not know the bubble sort algorithm and how it works then please go through the below article for a better understating of optimization.

Java Program To Insertion Sort With Example

1. Introduction

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time. It is much more efficient than Bubble Sort and less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

We can implement  Insertion sort using iterative and recursive approach. We will do in this post using Iterative approach. It is easy to understand when compared to recursive.

The insertion sorts repeatedly scans the list of items, each time inserting the item in the unordered sequence into its correct position.

Java Program to Bubble Sort 

Java Program To Shell Sort - Step by Step

1. Introduction

In this tutorial, We will learn how to implement the Shell Sort program in java.

First, We'll understand Shell Sort Algorithm then next see the java program on Shell Sort.

Shell sort is an algorithm that first sorts the elements far apart from each other and successively reduces the interval between the elements to be sorted. It is a generalized version of the insertion sort. In shell sort, elements at a specific interval are sorted.

Shell sort, also known as Shell sort or Shell's method, is an in-place comparison sort. It can be seen as either a generalization of sorting by exchange (bubble sort) or sorting by insertion (insertion sort). The method starts by sorting elements far apart from each other and progressively reducing the gap between them.

Collections sort() in Java - List Custom Sort Example

1. Introduction

In this tutorial, You'll learn how to sort Custom objects in java. First, We'll show the example program to sort List of Strings and Next move to the Custom sorting of Arraylist of Employee's. Sorting is done by Empoyee Id, Name and age. All examples shown are on GitHub at the end of this article.

2. Collections.sort() Example

Collections class has a method sort() which takes List implementation such as ArrayList, LinkedList etc.

Now, Creating a list with String values and sort the values using Collections.sort() method.

Collections.sort() method does the sorting in ascending order by default. All the values are added to the list must implement Comparable interface.

If null is passed to sort() method it throws java.lang.NullPointerException.

How To Sort ArrayList In Java – Collections.Sort() Examples

How To Sort ArrayList In Java :

In this post, we will learn how to sort ArrayList in java. This is very easy to understand and remember the methods.

1) Sorting ArrayList in ascending order
2) Sorting ArrayList in descending order

ArrayList in Java

Sorting List in Ascending order:

package com.java.w3schools;

import java.util.ArrayList;

import java.util.Collections;

import java.util.List;

public class FruitsArrayList {

      public static void main(String[] args) {

            List<String> fruits = new ArrayList<>();

            fruits.add("Mango");

            fruits.add("Orange");

            fruits.add("Apple");

            fruits.add("Banana");

            System.out.println("Printing fruits before sorting : " + fruits);

            Collections.sort(fruits);

            System.out.println("Printing fruits after sorting : " + fruits);

      }

}

Output:

Printing fruits before sorting : [Mango, Orange, Apple, Banana]

Printing fruits after sorting : [Apple, Banana, Mango, Orange]

Collections class has a method sort() which takes List as argument. This method does sorting in ascending order. Observer the output of the above program.

Sorting List in Descending order:

Just replace the Collection.sort with the following code snippet.

Collections.sort(fruits, Collections.reverseOrder());

Output:

Printing fruits before sorting : [Mango, Orange, Apple, Banana]

Printing fruits after sorting : [Orange, Mango, Banana, Apple]

Collections class has a method for sorting the list elements in reverse order that is descending order.

In the next post, we will learn how to sort a list of students where Student is a user defined class with properties of id, name, age.

Java Program to Bubble Sort(Sinking Sort)

Bubble Sort in Java | Sinking Sort Technique

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that repeatedly steps through the list to be sorted, compares each pair of adjacent items and swaps them if they are in the wrong order. The algorithm, which is a comparison sort, is named for the way smaller or larger elements "bubble" to the top of the list. Although the algorithm is simple, it is too slow and impractical for most problems even when compared to insertion sort. It can be practical if the input is usually in sorted order but may occasionally have some out-of-order elements nearly in position.

1) Easy to understand.
2) Easy to implement.
3) In-place, no external memory is needed.
4) Performs greatly when the array is almost sorted (This is part of Optimized Bubble Sort).
5) Widely used by students to clear practical exams or freshers interview process as the end result is the same as that of any sorting technique