diff --git a/programs/C++/sort_integer_array.cpp b/programs/C++/sort_integer_array.cpp
new file mode 100644
index 0000000..6eab30c
--- /dev/null
+++ b/programs/C++/sort_integer_array.cpp
@@ -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]<<" ";
+}
\ No newline at end of file
diff --git a/programs/C/sort.c b/programs/C/sort.c
new file mode 100644
index 0000000..83a4d3a
--- /dev/null
+++ b/programs/C/sort.c
@@ -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]);
+}
\ No newline at end of file
diff --git a/programs/Python/sorting.py b/programs/Python/sorting.py
new file mode 100644
index 0000000..e06e4ee
--- /dev/null
+++ b/programs/Python/sorting.py
@@ -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))