Added an optimized bubble sort in sorts

[rohleet]

Description of Change

Added an Optimized Bubble Sort implementation in the sorting section.
This version improves efficiency over the standard Bubble Sort by introducing a swap flag:

During each pass, adjacent elements are compared and swapped if out of order.

A flag is set whenever a swap occurs.

If no swaps happen in a pass, the algorithm terminates early since the array is already sorted.

Key Points:

Best Case (already sorted): O(n)

Average / Worst Case: O(n²)

Space Complexity: O(1) (in-place)

Stable Sort: Yes

This optimization reduces the number of passes in average and best cases, making it more efficient than the naive approach.

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:

[realstealthninja]

Please follow the documentation guidelines, The algorithm is good, you need to add documentation, remove the using namespace line.

thank you for raising this pr