FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
myCode/cppExample/selectionSort.cpp at master · rexprith/myCode · GitHub
rexprith
/
myCode
Public template
Notifications
You must be signed in to change notification settings
Fork
0
Star
1
Code
Issues
0
Pull requests
0
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
myCode
/
cppExample
/
selectionSort.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
43 lines (35 loc) · 731 Bytes
Breadcrumbs
myCode
/
cppExample
/
selectionSort.cpp
Copy path
File metadata and controls
43 lines (35 loc) · 731 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
//
Selection sort
//
Author: Prithwiraj Shome
#
include
<
iostream
>
using
namespace
std
;
//
Input the elements
int
main
()
{
int
numTotal;
int
min;
cout <<
"
Enter total number of elements to be sorted:
"
<< endl;
cin >> numTotal;
int
* arr = (
int
*)
malloc
(
sizeof
(
int
) * numTotal);
cout <<
"
Enter the elements:
"
<< endl;
for
(
int
i =
0
; i < numTotal; i++)
{
cin >> arr[i];
}
//
Selection Sort
for
(
int
i =
0
; i < numTotal; i++)
{
min = arr[i];
for
(
int
c = (i+
1
); c < (numTotal); c++)
{
if
(min > arr[c]) {
arr[i] = arr[c];
arr[c] = min;
min = arr[i];
}
}
}
cout <<
"
Sorted elements are:
"
<< endl;
for
(
int
i =
0
; i < numTotal; i++)
cout << arr[i] << endl;
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL