A Project Report On

“MICRO PROJECT SORTING TECHNIQUES”

SUBMITTED
BY
Ms. Neha Pagariya

Guided by:- Divyani Dhadiwal

Shri Hiralal Hastimal Jain Brother College, Chandwad

This is to certify that the project report entitled “Micro Project of soprting tecniques ”has been successfully
completed by Ms. Neha Pagariya under the guidance of Divyani Dhandiwal and submitted to Shri Hiralal
Hastimal Jain Brother College,Chandwad in recognition to the partial fulfillment for the award of Diploma
in Computer Technology

Signature Signature
Ms.Divyani Dhadiwal Mam Anita Chordiya Mam

DSU Micro-project 1
 Certificate

We certify that
• The work contained in this project has done by us under the guidance of my Guide.
• The work has not been submitted to any institute for any degree or diploma.
• We have followed the guidelines provided by the institute in preparing the project report.
• We have confirmed to the norms and guidelines given by in Ethical code of conduct of
the institute.
• Whenever we used materials (data, theoretical analysis, figures and text) from other
sources, we have given due credit to them by citing them in the text of the report and
giving their details in the references. Further, we have taken permission from the
copyright owners of the sources, whenever necessary.

Sr.No. Name Of Student Enrollment no

1. Mr. Neha Pagariya 2000790201

Signature. Signature
Ms.divyani Dhandiwal. Ms. Anita Chordiya

DSU Micro-project 2
 It is my Proud privilege to express a deep sense of gratitude and regard to my guide
Divyani Dhandiwal Co-ordinator of S.H.H.J.B Polytechnic, Chandwad.He Initiative and Keep
interest in every step provided a constant source of inspiration to our group of intensive in this
work.

I wish to place on record my sincere thanks to Anita Chordiya, H.O.D. of Computer

Engineering Department, S.H.H.J.B Polytechnic, Chandwad who provided the Valuable
guidance and constant encouragement to complete this dissertation.

There were also some turning point where for a moment , I found myself little depressed
and at these very critical junctures, I am proud to confess our teacher staff, which always
appeared as a lamp post of live inspiration.

So my Sincere thanks to all Professors, Department teaching, Non-Teaching Staff & my

group Members , all my friends who directly or indirectly helped me in the development &
evolution of my thoughts in completing this work.

DSU Micro-project 3
 INDEX
Sr. No Topic Name Page No.

1 Abstract

2 Introduction

3 Literature review

4 Program Code

5 Output

6 Advantages

7 Disadvantages

8 Future scope

Conclusion
9

10 Reference

DSU Micro-project 4
 REQUIREMENT
This process is adopted when management of the system development, Personnel decide
that the particular system needs improvement. The system development life cycle is the set of
activities, carried out by the analyst, designers and users to develop and implement a system. The
systems that are present in the nature follow common life cycle pattern. For example consider
the raining system. Initially the rain falls into the river, river flows into sea, the sea water
evaporates to form vapors, the vapors form clouds which again bring rain. Similarly consider a
manmade system initially a system is analyzed, designed and made operational by the efforts of
system analysis. After successful operation or a number of users, the system becomes less and
less effective by change in the environment. So these changes have to be incorporated in to the
system by minor modifications. So the general activities from the life cycle of the system are
given below: Select ion and identification of the system to be studied
• Preliminary study
• Defining the system
• Design and development of the system Hardware Requirements:
• i-3 Generation Processor
• 2 GB RAM
• Windows XP/7
• Turbo C3 / Dev C Software

DSU Micro-project 5
 - : INTRODUCTION : -

Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a
time. It is much less efficient on large lists than more advanced algorithms such as quicksort,
heapsort, or merge sort. However, insertion sort provides several advantages like simple
implementation, efficient for (quite) small data sets, more efficient in practice than most other
simple quadratic algorithms, adaptive, stable, in-place; i.e., only requires a constant amount of
additional memory space, online; i.e., can sort a list as it receives it

Sorting
Sorting algorithms may require some extra space for comparison and temporary storage of few data
elements. These algorithms do not require any extra space and sorting is said to happen in-place, or
for example, within the array itself. This is called in-place sorting. Bubble sort is an example of in-
place sorting.
However, in some sorting algorithms, the program requires space which is more than or equal to the
elements being sorted. Sorting which uses equal or more space is called not-in-place sorting. Merge-
sort is an example of not-in-place sorting.

DSU Micro-project 6
 -:PROGRAM CODE:-

/* Simple Insertion Sort Program Using Functions in C*/

/* Data Structure Programs,C Array Examples */

#include<stdio.h>
#include<conio.h>

#define MAX_SIZE 5

void insertion(int[]);

int main() {
int arr_sort[MAX_SIZE], i;

printf("Simple Insertion Sort Example - Array and Functions\n");

printf("\nEnter %d Elements for Sorting\n", MAX_SIZE); for (i = 0; i <
MAX_SIZE; i++)
scanf("%d", &arr_sort[i]);

printf("\nYour Data :"); for (i = 0; i <

MAX_SIZE; i++) { printf("\t%d",
arr_sort[i]);
}

insertion(arr_sort); getch();
}

void insertion(int fn_arr[]) {

int i, j, a, t;
for (i = 1; i < MAX_SIZE; i++) { t=
fn_arr[i]; j = i - 1;

while (j >= 0 && fn_arr[j] > t) {

fn_arr[j + 1] = fn_arr[j];
j = j - 1; }
fn_arr[j + 1] = t;

DSU Micro-project 7
 printf("\nIteration %d : ", i); for (a = 0; a
< MAX_SIZE; a++) {
printf("\t%d", fn_arr[a]);
}
}

printf("\n\nSorted Data :"); for (i = 0; i <

MAX_SIZE; i++) { printf("\t%d",
fn_arr[i]);
}
}

-:OUTPUTS:-

DSU Micro-project 8
Simple Insertion Sort Example - Array and Functions

Enter 5 Elements for Sorting

901
56
34
23
2

Your Data : 901 56 34 23 2

Iteration 1 : 56 901 34 23 2
Iteration 2 : 34 56 901 23 2
Iteration 3 : 23 34 56 901 2
Iteration 4 : 2 23 34 56 901

Sorted Data : 2 23 34 56 901

------------------
(program exited with code: 0)

Press any key to continue . . .

DSU Micro-project 9
DSU Micro-project 10