This document discusses a minor project on sorting techniques using functions in C++. It is authored by a group of 4 students and their project guide. The document introduces different sorting algorithms like bubble sort, insertion sort, and selection sort. It provides examples to explain how each algorithm works step-by-step to sort an array of numbers in ascending order. C and C++ are computer programming languages commonly used for software development, and sorting is an important technique to arrange data in a desired order.

1. MINOR PROJECTMINOR PROJECT
Group No.- ETA-08Group No.- ETA-08
Name of Group membersName of Group members:-:-
1.1. PRAVEEN KANSARIPRAVEEN KANSARI
2.2. SURBHI NAIDUSURBHI NAIDU
3.3. SMITA SINGHSMITA SINGH
4.4. NEHA SINGHNEHA SINGH
Name of project guideName of project guide:-:-
Prof. HITESH KISHNANIProf. HITESH KISHNANI
RUNGTA COLLEGE OFRUNGTA COLLEGE OF
ENGINEERING & TECHNOLGY,ENGINEERING & TECHNOLGY,
RAIPURRAIPUR

2. SORTING TECHNIQUES
USING FUNCTION

3. About C++About C++
C++ is a computer
programming language.
And the programming
language C++ was
developed by BJARNE
STROUSTRUP at
AT&T Bell Laboratories
in Murray Hill, New
Jesrey, USA in the early
1980.

4. SORTING
INTRODUCTIONINTRODUCTION:-:-
Sorting is a technique to rearrange theSorting is a technique to rearrange the
elements of a list in ascending or descendingelements of a list in ascending or descending
order, which can be numerical, lexicographical,order, which can be numerical, lexicographical,
or any user-defined order. Sorting is a processor any user-defined order. Sorting is a process
through which the data is arranged in ascendingthrough which the data is arranged in ascending
or descending order. Sorting is the part of theor descending order. Sorting is the part of the
Data StructureData Structure..

5. Example of the sorting:-
Fig.(1)- Before Sorting Fig.(2)-After Sorting
Before Sorting After Sorting

6. TYPES OF
SORTING
5.Merge Sort.5.Merge Sort.
6.Quick Sort.6.Quick Sort.
7.Heap Sort.7.Heap Sort.
8.Shell Sort.8.Shell Sort.
1.Bubble Sort.1.Bubble Sort.
2.Insertion2.Insertion
Sort.Sort.
3.Selection3.Selection
Sort.Sort.
4.Bucket Sort.4.Bucket Sort.

7. BUBBLE SORT
In bubble sort methodIn bubble sort method
the list is divided into twothe list is divided into two
sub-lists sorted andsub-lists sorted and
unsorted. The smallestunsorted. The smallest
element is bubbled fromelement is bubbled from
unsorted sub-list.unsorted sub-list.

8. Example of Bubble Sort

9. Example of Bubble Sort
Swap?

10. Example of Bubble Sort
Yes!

11. Example of Bubble Sort
Swap?

12. Example of Bubble Sort
No

13. Example of Bubble Sort
Swap?

14. Example of Bubble Sort
No

15. Example of Bubble Sort
Swap?

16. Example of Bubble Sort
Yes!

17. Example of Bubble Sort
Swap?

18. Example of Bubble Sort
Yes!

19. Example of Bubble Sort
Swap?

20. Example of Bubble Sort
No

21. Example of Bubble Sort
Swap?

22. Example of Bubble Sort
No

23. Example of Bubble Sort
Swap?

24. Example of Bubble Sort
Yes!

25. Example of Bubble Sort
Swap?

26. Example of Bubble Sort
Yes!

27. Example of Bubble Sort
Swap?

28. Example of Bubble Sort
No

29. Example of Bubble Sort
Swap?

30. Example of Bubble Sort
No

31. Example of Bubble Sort
Swap?

32. Example of Bubble Sort
Yes!

33. Example of Bubble Sort
Swap?

34. Example of Bubble Sort
Yes!

35. Example of Bubble Sort
Swap?

36. Example of Bubble Sort
No

37. Example of Bubble Sort
Swap?

38. Example of Bubble Sort
No

39. Example of Bubble Sort
Swap?

40. Example of Bubble Sort
This picture
shows an
array of six
integers that
is sorted by
Bubble sort
from
smallest to
larges.

41. INSERTION SORT
In bubble sort methodIn bubble sort method
the list is divided into twothe list is divided into two
sub-lists sorted andsub-lists sorted and
unsorted. The smallestunsorted. The smallest
element is bubbled fromelement is bubbled from
unsorted sub-list.unsorted sub-list.

42. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
These columnsThese columns
or arrays areor arrays are
not sorted.not sorted.
The unsortedThe unsorted
arrays arearrays are
shown in theshown in the
figure.figure.

43. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Unsorted sideSorted sideSorted side Unsorted side
The sortedThe sorted
side startsside starts
with just thewith just the
first element,first element,
which is notwhich is not
necessarilynecessarily
the smallestthe smallest
element.element.

44. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
The sortedThe sorted
side grows byside grows by
taking thetaking the
front elementfront element
from thefrom the
unsortedunsorted
side...side...

45. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
...and...and
inserting it ininserting it in
the place thatthe place that
keeps thekeeps the
sorted sidesorted side
arranged fromarranged from
small to largesmall to large..

46. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
The two
arrays or
column are
sorted in this
figure.

47. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
In this time
the arrays
are sorted so
we don’t
need to
move any
element.
Sorted side Unsorted side

48. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted sideIn this time,
we also
don’t need
to move the
any array
because
these are
already
sorted.

49. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
Copy theCopy the
newnew
element toelement to
a separatea separate
location.location.

50. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
ShiftShift
elements inelements in
the sortedthe sorted
side,side,
creating ancreating an
open spaceopen space
for the newfor the new
element.element.

51. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Insert theInsert the
element.element.
Shift elementsShift elements
in the sortedin the sorted
side, creatingside, creating
an open spacean open space
for the newfor the new
element.element.

52. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
ContinueContinue
shiftingshifting
elements...elements...

53. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
ContinueContinue
shiftingshifting
elements...elements...

54. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
...until you...until you
reach thereach the
location forlocation for
the newthe new
element.element.

55. Example of Insertion Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
Copy the newCopy the new
element backelement back
into the array,into the array,
at the correctat the correct
location.location.

56. Example of Insertion Sort
Sorted side Unsorted side
The lastThe last
element mustelement must
also bealso be
inserted. Startinserted. Start
by copying it...by copying it...

57. Example of Insertion Sort
This is theThis is the
finale sortedfinale sorted
result by theresult by the
InsertionInsertion
sort.sort.

58. SELECTION SORT
In selection sort the list is divided into
two sub-lists sorted and unsorted.
These two lists are divided by imaginary
wall. We find a smallest element from
unsorted sub-list and swap it to the
beginning. And the wall moves one
element ahead, as the sorted list is
increases and unsorted list is
decreases.

59. Example of Selection Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
These columnsThese columns
or arrays areor arrays are
not sorted.not sorted.
The unsortedThe unsorted
arrays arearrays are
shown in theshown in the
figure.figure.

60. Example of Selection Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Start byStart by
finding thefinding the
smallestsmallest
entry.entry.

61. Example of Selection Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Swap theSwap the
smallestsmallest
entry withentry with
the firstthe first
entry.entry.

62. Example of Selection Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Swap theSwap the
smallestsmallest
entry withentry with
the firstthe first
entry.entry.

63. Example of Selection Sort
0
10
20
30
40
50
60
70
[1] [2] [3] [4] [5] [6]
Sorted side Unsorted side
Part of thePart of the
array isarray is
now sorted.now sorted.

64. Find the
smallest
element in
the unsorted
side.
Sorted side Unsorted side
Example of Selection Sort

65. Example of Selection Sort
Unsorted sideSorted side
Swap withSwap with
the front ofthe front of
thethe
unsortedunsorted
side.side.

66. Example of Selection Sort
We haveWe have
increasedincreased
the size ofthe size of
the sortedthe sorted
side by oneside by one
element.element.
Sorted side Unsorted side

67. Example of Selection Sort
Sorted side Unsorted side
Smallest
from
unsorted
Smallest
from
unsorted
TheThe
processprocess
continues...continues...

68. Example of Selection Sort
TheThe
processprocess
continues...continues...
Sorted side Unsorted side
Swap
with
front
Swap
with
front

69. Example of Selection Sort
TheThe
processprocess
continues...continues...
Sorted side Unsorted side

70. Example of Selection Sort
Check theCheck the
smallestsmallest
array inarray in
unsortedunsorted
side &side &
sorted this.sorted this.
Unsorted sideSorted side

71. Example of Selection Sort
TheThe
process isprocess is
continue….continue….
Sorted side Unsorted side

72. Example of Selection Sort
The array isThe array is
now sortednow sorted
by theby the
SelectionSelection
sort.sort.

73. The C & C++ is the ComputerThe C & C++ is the Computer
programming language.programming language. The sorting
technique uses for rearrange the data
in increasing or decreasing order.
The computer programming
language C and C++ are used in the
many works as like web development
and other.
Conclusion:-