refactored internal classes associated with hash-table based implementation of Kendall Tau Sequence Distance (#486)

* moved relabeler to internal package

* refactored Relabel;ByHashing

* Update CHANGELOG.md

Author: cicirello

CHANGELOG.md

@@ -4,7 +4,7 @@ All notable changes to this project will be documented in this file.
 The format is based on [Keep a Changelog](https://keepachangelog.com/en/1.0.0/),
 and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0.html).
 
-## [Unreleased] - 2025-05-15
+## [Unreleased] - 2025-10-05
 
 ### Added
 
@@ -15,6 +15,7 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0
 ### Removed
 
 ### Fixed
+* Refactored the internal classes associated with the hash-table implementation of Kendall Tau Sequence Distance, which were identified by RefactorFirst as highly-coupled.
 
 ### Dependencies
 

src/main/java/org/cicirello/sequences/distance/KendallTauSequenceDistance.java

@@ -1,6 +1,6 @@
 /*
  * JavaPermutationTools: A Java library for computation on permutations and sequences
- * Copyright 2005-2023 Vincent A. Cicirello, <https://www.cicirello.org/>.
+ * Copyright 2005-2025 Vincent A. Cicirello, <https://www.cicirello.org/>.
  *
  * This file is part of JavaPermutationTools (https://jpt.cicirello.org/).
  *
@@ -23,6 +23,9 @@
 
 import java.util.Arrays;
 import java.util.List;
+import org.cicirello.sequences.distance.internal.KendallTauRelabeler;
+import org.cicirello.sequences.distance.internal.RelabelByHashing;
+import org.cicirello.sequences.distance.internal.RelabelBySorting;
 
 /**
  * Kendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one