feat: add hybrid quick-insertion-selection sorting algorithm with tests

[cesar-011]

Description of Change

Added a hybrid sorting algorithm combining QuickSort, Insertion Sort, and Selection Sort.
Included tests and example usage.
This implementation is for educational purposes and follows the project's style guidelines.

Checklist

• Added description of change
• Added file name matches File name guidelines
• Added tests and example, test must pass
• Added documentation so that the program is self-explanatory and educational - Doxygen guidelines
• Relevant documentation/comments is changed or added
• PR title follows semantic commit guidelines
• Search previous suggestions before making a new one, as yours may be a duplicate.
• I acknowledge that all my contributions will be made under the project's license.

Notes: "Hybrid of QuickSort, Insertion Sort, and Selection Sort for educational purposes, not optimized for speed."

[cesar-011]

@realstealthninja @Panquesito7

[realstealthninja]

Try not to use the raw array and instead opt for either std::vector incase you want an array of dynamic length or std::array if the size is known at compile time

[realstealthninja]

Suggested change

	/**
	* @brief print the array
	*/
	/**
	* @brief print the array
	* @tparam T
	* @param arr
	* @param size
	*/

[cesar-011]

I will make the changes soon. Thank you for the corrections.

[cesar-011]

@realstealthninja I have just made the requested changes.