* fix: correct hash table insertion
* Use a pointer to a pointer instead of a single pointer in the insert function, ensuring proper updates to the hash table
* Bug fixes: This fixes issues with empty results.
* fix: correct issues in radix sort
* Replaced loop-based array copy with memcpy to ensure efficient memory copying in countingSortDigit
* Fixed a bug in radixSort where the maximum value search loop skipped the last element
* Bug fix: Ensures all elements are checked when determining the maximum value in the array
* perf: improve memory management by adding explicit memory release
* revert: Revert to using the old loop override array method and drop specific api's like memcpy.
Fleey
krahets