Skip to content

URK21CS2020AKASHNAIR/exercise-9-a-merge-sort-URK21CS2052-SAMSON

 
 

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

6 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Problem

Given an array of integers, sort the array in ascending order using Merge sort. The final sorted array should not be returned by the function, but instead be stored inside the array, data.

Constraints

-5 * 104 <= data[i] <= 5 * 104

Sample Input - 1

-23, -40, 10, 5, -9, 0, 1

Sample Output - 1

[-40, -23, -9, 0, 1, 5, 10]

Sample Input - 2

5, 1, 1, 2, 0, 0

Sample Output - 2

[0, 0, 1, 1, 2, 5]

About

exercise-9-a-merge-sort-URK21CS2052-SAMSON created by GitHub Classroom

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages

  • Python 100.0%