search

codezonediitj / pydatastructs

A python package for data structures and algorithms
https://pydatastructs.readthedocs.io/en/stable/
Other
202 stars 270 forks source link

Implement Parallel Timsort #318

Open Arvind-raj06 opened 3 years ago

Arvind-raj06 commented 3 years ago

Description of the problem

Timsort is a hybrid stable sorting algorithm, derived from merge sort and insertion sort, designed to perform well on many kinds of real-world data. It is already there in Python so a parallel version of the same algorithm should be added.

Example of the problem

This sorting algorithm is implemented in python by default as sort() and sorted() methods

References/Other comments

https://en.wikipedia.org/wiki/Timsort

czgdp1807 commented 3 years ago

This type of sort is already provided by python internally. Though for educational purposes can be added but not very important.

dillu9878 commented 3 years ago

I would like to contribute code for timsort under gssoc'21.

sakshi2707 commented 3 years ago

Hey, I'm a GSSoC`21 participant and want to contribute to this . can you please assign me this issue?

Smit-create commented 3 years ago

. can you please assign me this issue?

You are free to work on the issue and raise a PR. We generally don't assign issues.