Neoalgo: Implementation of Matrix Sorting

[nutanaarohi123]

🚀 Matrix_Sorting

Matrix sorting aims to sort the elements of the given matrix without affecting the matrix structure.
The algorithm takes as input a 2D array of elements and sorts it in the desired order. The elements are present in the desired order once the algorithm stops. Example below:
Input : matrix[][] = { {5, 7, 4},
{8, 3, 1},
{2, 6, 9} }
Output : 1 2 3
4 5 6
7 8 9

Have you read the Contributing Guidelines on Pull Requests?

Yes

Motivation

It has a time complexity of O(n√nlog√n) and hence takes lesser time than existing algorithms of an unsorted matrix with time complexity of O(n2) algorithms.

Pitch

I would like to add Matrix Sorting Algorithm in the Data Structure section. It will make the code more efficient and easy to implement by reducing the time complexity.

Assignees:

• C : @narayan2111
• CPP : @GrayFlash
• Java : @nutanaarohi123
• Python: @rohangawhade
• JavaScript :
• C# :
• Go :

[nutanaarohi123]

I would like to work on this issue in JAVA and C++. Kindly assign this task as a part of Hakincodes 2020. @Kajol-Kumari @SKAUL05 @atarax665 @iamrajiv @siddharth25pandey

[nutanaarohi123]

Please label this issue as CH20.

[SKAUL05]

@nutanaarohi123 Can't assign for multiple languages.
Which one do u want

[rohangawhade]

I would like to work on this using python.

[GrayFlash]

@SKAUL05 can u assign me JAVA

[nutanaarohi123]

@nutanaarohi123 Can't assign for multiple languages.
Which one do u want

I would like to work on this issue in JAVA.

[GrayFlash]

I can C++, if possible to assign me

[narayan2111]

I would like to work on this issue in C language. Please assign this to me. @SKAUL05

[GrayFlash]

@SKAUL05 I made a pr for cpp implementation #829 . Can you verify and merge.

[HarshCasper]

We are logging the scores for the Contributor's Hack 2020. If you have one or more than one PR merged during the program, make sure to fill this form

[github-actions[bot]]

Please reopen this issue once you add more information and updates here. If this is not the case and you need some help, feel free to seek help from our Telegram or ping one of the reviewers. Thank you for your contributions!