Skip to content
Open

Sort #127

Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 24 additions & 0 deletions programs/C++/sort_integer_array.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,24 @@
#include<iostream>

using namespace std;

int main()
{
int n;
cout<<"Enter the number of elements: ";
cin>>n;
int a[n];
int temp;
for(int i=0;i<n;i++) cin>>a[i];
for(int i=0;i<n;i++)
for(int j=1;j<n-i;j++)
{
if(a[j-1]>a[j])
{
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
for(int i=0;i<n;i++) cout<<a[i]<<" ";
}
21 changes: 21 additions & 0 deletions programs/C/sort.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,21 @@
#include<stdio.h>
int main()
{
int n,i,j,temp;
printf("Enter the number of elements: ");
scanf("%d",&n);
int a[n];
for(i=0;i<n;i++) scanf("%d",&a[i]);
for(i=0;i<n;i++)
for(j=1;j<n-i;j++)
{
if(a[j-1]>a[j])
{
temp=a[j-1];
a[j-1]=a[j];
a[j]=temp;
}
}
for(i=0;i<n;i++)
printf("%d ",a[i]);
}
18 changes: 18 additions & 0 deletions programs/Python/sorting.py
Original file line number Diff line number Diff line change
@@ -0,0 +1,18 @@
arr=[]
num=int(input("enter no. of elements: ")) #no. of elements in the array
for i in range(num):
element=int(input("element"+str(i+1)+": "))
arr.append(element)
print("Original array: ")
print(arr)
#sort function
def sorting(arr):
for i in range(n):
for j in range(i+1,n):
if (arr[i]>arr[j]):
temp=arr[i]
arr[i]=arr[j]
arr[j]=temp
return arr
print("sorted array: ")
print(sorted(arr))