Algo_ds_101: Brick Sort

[Rj-coder-iitian]

Submission Title
Brick Sort

Submission Type
Algorithm

Submission Description
In computing, an odd–even sort or odd–even transposition sort is a relatively simple sorting algorithm, developed originally for use on parallel processors with local interconnections. It is a comparison sort related to bubble sort, with which it shares many characteristics.
Inventor: Habermann
Worst complexity: n^2
Average complexity: n^2
Best complexity: n
Space complexity: 1
Method: Exchanging
Stable: Yes

Contributors

• [x] C++ -
• [ ] C -
• [x] Python -
• [ ] Java -
• [x] JavaScript -
• [ ] TypeScript -
• [ ] Golang -
• [ ] Ruby -
• [ ] Scala -

[Rj-coder-iitian]

@ahampriyanshu I want to work on this please assign this to me.

[ahampriyanshu]

@ahampriyanshu I want to work on this please assign this to me.

@Rj-coder-iitian Please mention your preffered language

[shivamkumar123]

I want to work on it in C++. Please assign it to me @ahampriyanshu

[saideepesh000]

I want to work on it in JavaScript.

[ArpitDarklord]

I want to give it a shot in python.Please assign it to me @ahampriyanshu

[shwhite17]

assign to me for java @ahampriyanshu

[anubhav2005]

I would like to work on this issue. I will use Java to solve this issue. can you please assign me with this issue? Thank you.

[cuber485]

I want to work on it in C. Please assign it to me @ahampriyanshu

[ahampriyanshu]

thanks @everyone :v: