Bricksort parallel implemented

[HarsheetKakar]

References to other Issues or PRs or Relevant literature

Fixes #129

Brief description of what is fixed or changed

Thread based bricksort implemented

Other comments

[codecov]

Codecov Report

Merging #221 into master will increase coverage by 1.439%.
The diff coverage is 100.000%.

@@              Coverage Diff              @@
##            master      #221       +/-   ##
=============================================
+ Coverage   97.123%   98.562%   +1.439%     
=============================================
  Files           24        24               
  Lines         2016      2087       +71     
=============================================
+ Hits          1958      2057       +99     
+ Misses          58        30       -28     

Impacted Files	Coverage Δ
pydatastructs/linear_data_structures/__init__.py	100.000% <ø> (ø)
pydatastructs/linear_data_structures/algorithms.py	100.000% <100.000%> (ø)
pydatastructs/graphs/__init__.py	100.000% <0.000%> (ø)
pydatastructs/graphs/algorithms.py	100.000% <0.000%> (ø)
pydatastructs/graphs/adjacency_list.py	100.000% <0.000%> (ø)
pydatastructs/graphs/adjacency_matrix.py	100.000% <0.000%> (ø)
...datastructs/linear_data_structures/linked_lists.py	99.613% <0.000%> (+0.006%)	⬆️
pydatastructs/utils/misc_util.py	100.000% <0.000%> (+9.259%)	⬆️
pydatastructs/trees/m_ary_trees.py	90.625% <0.000%> (+56.250%)	⬆️

[czgdp1807]

I have made some suggestions. Using futures isn't useful,

1. Consumes extra memory.
2. The check using all is sequential which makes doing comparisons using threads useless.

The suggestions pass is_sorted as a list(for passing by reference automatically) and the first element is made False whenever a thread swaps and doesn't change if no swap occurs or in simple words, write to is_sorted[0] happens only when a swap occurs.
It should work but I am not very sure that it will.

[HarsheetKakar]

I have made some suggestions. Using futures isn't useful,

1. Consumes extra memory.
2. The check using all is sequential which makes doing comparisons using threads useless.

The suggestions pass is_sorted as a list(for passing by reference automatically) and the first element is made False whenever a thread swaps and doesn't change if no swap occurs or in simple words, write to is_sorted[0] happens only when a swap occurs.
It should work but I am not very sure that it will.

I get it, working on it now

[HarsheetKakar]

good to go? @czgdp1807