Implement C++ Backend for Brick Sort and Brick Sort Parallel

[arvinder004]

Description of the problem

This issue proposes the addition of a C++ backend for the Brick Sort algorithm (also known as Odd-Even Sort) and its parallel version to the pydatastructs library. Brick Sort is a comparison-based sorting algorithm that iteratively compares and swaps adjacent elements in two phases: odd-indexed pairs and even-indexed pairs. While simple, it can be optimized for performance with a C++ implementation and parallelized using multi-threading to leverage independent comparisons in each phase. This addition will enhance the library's linear data structure algorithms by providing an efficient, parallelizable sorting option for arrays or lists.