Sorting Odd Numbers with Insertion Sort in Java

Learn how to sort odd numbers in an array using insertion sort while keeping even numbers in their relative positions. Practical Java code included!
---

Visit these links for original content and any more details, such as alternate solutions, latest updates/developments on topic, comments, revision history etc. For example, the original title of the Question was: Using Insertion-sort for sorting only odd numbers

If anything seems off to you, please feel free to write me at vlogize [AT] gmail [DOT] com.
---
Sorting Odd Numbers with Insertion Sort in Java: A Step-by-Step Guide

Sorting is a fundamental aspect of programming, and it can often pose unique challenges. One such challenge is sorting only specific types of numbers in an array while leaving others untouched. In this guide, we will explore how to sort only odd numbers using the insertion sort algorithm in Java, while keeping even numbers intact and preserving their original order on the right side of the array.

Understanding the Problem

Imagine you have an array of integers that contains both odd and even numbers. Your goal is to sort only the odd numbers in ascending order and push all even numbers to the right side without changing their relative order.

Example:

Consider the following array:

[[See Video to Reveal this Text or Code Snippet]]

After applying the sorting logic, the desired output should look like this:

[[See Video to Reveal this Text or Code Snippet]]

Approach to the Solution

In order to achieve this, we'll follow several steps to modify the insertion sort algorithm. Below are the instructions on how to implement this solution effectively.

Modifying the Insertion Sort Algorithm

Identify Odd Numbers:

We will check each number in the array. If it is odd (i.e., key % 2 == 1), we will proceed to sort it; if it is even, we will skip it.

Adjust Insertion Logic:

During the insertion process, we need to ensure that we not only move the odd numbers but also skip over the even numbers (to maintain their order). The while loop's condition will be updated to handle this.

Updated Code

Here’s how you can modify your code to sort only the odd numbers:

[[See Video to Reveal this Text or Code Snippet]]

Explanation of Code Modifications

Add Validation for Odd Numbers: The line if (key % 2 == 1) checks if the current key is an odd number. If it is even, the current key will be ignored, thus leaving even numbers unsorted.

Update Positioning Logic: The while loop conditions must reflect two main points:

a[j] > key: This ensures that larger odd numbers are moved to the right.

a[j] % 2 == 0: This condition skips even numbers, maintaining their original position on the right side of the array.

Conclusion

With the adjustments made, the modified insertion sort provides the functionality needed to sort odd numbers while leaving even numbers unaltered. This approach not only solves the problem effectively but also enhances understanding of sorting algorithms and their flexibility.

By applying this technique, you're better prepared to handle diverse array sorting challenges in Java. Happy coding!