GOVERNMENT POLYTECHNIC , RATNAGIRI

A Project Report On

“Merge Sort using Shell Script”

Submitted to

“COMPUTER DEPARTMENT”
Under the guidance of

PATNE.G.D

Submitted By
Mane Jivan-(2100130247)
More Mrudul-(2100130250)
Nevarekar Siddhant-(2100130256)

Through

GOVERNMENT POLYTECHNIC, RATNAGIRI

2023-2024
 MAHARASHTRA STATE

BOARDOF TECHNICAL

EDUCATION
Certificate

This is certify that of fifth semester of diploma in T.Y.C.O of Institute

Government Polytechnic Ratnagiri (code 0013) has completed the term work
satisfactorily in subject programming with Operating System for the academic
year 2023 to 2024 as prescribed in the curriculum.

List of team member:

Mane Jivan - (2100130247)

More Mrudul - (2100130250)
Nevarekar Siddhant - (2100130256

Place: Ratnagiri

Date:

(Subject Teacher) (HOD) (Principle)

 Merge Sort using Shell Script

1.0 RATIONALE:

The rationale behind shell script lies in its ability to automate tasks and execute
multiple commands in sequence. Merge sort is a widely used and efficient comparison-based
sorting algorithm. This rationale seeks to provide an in-depth understanding of shell script and its
core concepts as well as understanding merge sort algorithm.

2.0 COURSE OUTCOME INTEGRATED:

1. Use Operating system tools to perform various functions. (22516 - b)

2. Apply file management techniques. (22516 - f)

3.0 LITERATU REREVIEW:

1) Introduction to Merge Sort:

Merge Sort is a widely used comparison-based sorting algorithm that follows the divide
and conquer strategy. It divides the unsorted list into n sublists, each containing one
element, and then repeatedly merges sublists to produce new sorted sublists until there is
only one sublist remaining. It is known for its stable sorting nature and consistent O(n log
n) time complexity.

2) Historical Context:

Merge Sort was introduced by John von Neumann in 1945, making it one of the earliest
sorting algorithms to be devised. Its efficiency and simplicity have contributed to its
enduring popularity in computer science and programming.

3) Performance Analysis:

Time Complexity Analysis: Detailed examination of Merge Sort's time complexity,

especially in comparison to other sorting algorithms like Quick Sort and Heap Sort.

Space Complexity Analysis: Discussion on the space requirements of Merge Sort and
how it compares to other algorithms in terms of memory usage.
4.0 ACTUAL PROCEDURE FOLLOWED:

Step 1: Start with an unsorted list. Divide it into two

roughly equal sublists, continuing recursively until each

sublist contains only one element.

Step 2: Sort each sublist individually by applying the merge

sort algorithm recursively.

Step 3 : Combine and merge the sorted sublists back

together to create a single, sorted list. During merging,

compare elements from the two sublists and select the

smaller element for the merged list.

5.0 ACTUAL RESOURCE USE:

Sr. Name of Resource/ Specification Qty Remarks

No. material
1 Unix Operating system Ubuntu 1
2 Virtual Box V 7.0.10 1
3 Browser Google chrome 1
4 Textbook Data Structures Using 1
documentation ‘C’
6.0 OUTPUT OF MICROPROJECT:

Code:
Output :-
7.0 SKILL DEVELOPED:

1. Algorithmic thinking and problem-solving.

2. Coding proficiency and logical thinking.
3. Understanding shell script.

8.0 APPLICATIONS OF THIS MICRO PROJECT:

1) Software can be implemented using the same logic as a online test or quiz competition.

9.0 AREA OF FUTURE IMPROVEMENT:

1) More formation such as online test paper, E-voting can be done using different functions in
JavaScript.