[OTHER] Refactor: Standardize comparison logic using SortUtils

[codingmydna]

What would you like to share?

This issue proposes a refactoring to standardize the comparison logic across various sorting algorithms in the sorts directory.

Currently, some sorting algorithm implementations directly use Comparable.compareTo() for element comparisons (e.g., array[i].compareTo(array[j]) > 0), while others utilize the utility methods provided by SortUtils (e.g., SortUtils.greater(array[i], array[j])).

The goal of this refactoring is to replace direct compareTo() calls with the corresponding SortUtils.less(), SortUtils.greater(), or SortUtils.greaterOrEqual() methods where applicable.

Additional information

I have identified the following files that currently use direct compareTo() calls and can be refactored:

• AdaptiveMergeSort.java
• BinaryInsertionSort.java
• BitonicSort.java
• BucketSort.java (partial, where compareTo is used for boolean comparison)
• CircleSort.java
• DutchNationalFlagSort.java
• ExchangeSort.java
• FlashSort.java (partial, where compareTo is used for boolean comparison)
• IntrospectiveSort.java
• OddEvenSort.java
• SelectionSort.java
• SelectionSortRecursive.java
• StalinSort.java
• StrandSort.java
• WiggleSort.java (partial, where compareTo is used for boolean comparison)

(Note: Files like CycleSort.java, PatienceSort.java, SpreadSort.java that use compareTo() for equality checks or value calculations will not be modified, as SortUtils does not provide direct equivalents for these specific use cases.)

I am willing to create a Pull Request to implement this refactoring.

[vandan09]

Hi @codingmydna,
I'd like to take on this entire refactoring task and update all the mentioned files to use SortUtils methods instead of direct compareTo() calls.
Let me know if that's okay - I'll start working on it once I get a confirmation.
Thanks!

[codingmydna]

@vandan09 Thank you for your interest in this issue.
My intention was to outline this refactoring and personally undertake its implementation.
My plan is to begin work on this myself. If I encounter any challenges or require assistance along the way, I will certainly reach out to the community for support and welcome collaboration.
I appreciate your interest

[siriak]

@codingmydna looks good, please proceed. As for equality checks, you could also add a method to sortUtils to check for that

[Rahulafk]

g

…

On Fri, 4 Jul 2025, 23:24 Andrii Siriak, ***@***.***> wrote: *siriak* left a comment (TheAlgorithms/Java#6336) <#6336 (comment)> @codingmydna <https://github.com/codingmydna> looks good, please proceed. As for equality checks, you could also add a method to sortUtils to check for that — Reply to this email directly, view it on GitHub <#6336 (comment)>, or unsubscribe <https://github.com/notifications/unsubscribe-auth/AQ2DSD6FKPIMHWOB4HRWB433G25WRAVCNFSM6AAAAACAW2CSJSVHI2DSMVQWIX3LMV43OSLTON2WKQ3PNVWWK3TUHMZTAMZWHE3DQMRSHA> . You are receiving this because you are subscribed to this thread.Message ID: ***@***.***>