DSA - Practical 10 Merge Sort

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 4

DSA Yash vardhan singh 22000290

NAVRACHANA UNIVERSITY

SCHOOL OF ENGINEERING & TECHNOLOGY


Bachelor of Computer Applications Program

CLASS: First Year – BCA

SEMESTER: 2

COURSE: Data Structures and Algorithms

SUBJECT CODE: CMP212

ACADEMIC YEAR: 2022 -23 (SPRING)

PRACTICAL 10

STUDENT ID:22000290

NAME: yash vardhan singh

AIM: Implementing Merge sort in python


DSA Yash vardhan singh 22000290

Description: Sorting is the technique of arranging elements in a specific order. Efficiency of


data handling can be substantially increased if the data are sorted according to some criteria
or order. Therefore, sorting is a very important computer application activity. Many sorting
algorithms are available for different applications. Also, computers store large amounts of
data from which individual records must be retrieved according to specific search criterion.
Searching algorithms make this process easier. The aim of this practical is to study and
implement sorting and searching algorithms.
Practical Outcome:
On performing this practical, students will be able to:
- Enter elements into a list and arrange them in ascending order using merge sort sorting
technique.
Software: Any IDE for python or CLI for python or online python coding environment
interpreter

TASK:
Perform the following practical and attach relevant screenshots for the
following:
Implement merge sort for the element values that the user enters and also size of the list has to be
defined by the user.
DSA Yash vardhan singh 22000290
DSA Yash vardhan singh 22000290

Output:

----------------------------------END OF PRACTICAL ----------------------------------------------

You might also like