diff --git a/SortingAlgorithms/C++/Bubble_Sort.cpp b/SortingAlgorithms/C++/Bubble_Sort.cpp
new file mode 100644
index 0000000..b92b85f
--- /dev/null
+++ b/SortingAlgorithms/C++/Bubble_Sort.cpp
@@ -0,0 +1,37 @@
+#include <iostream>
+using namespace std;
+
+void bubble_sort(int a[],int n){
+	int t;
+	for(int i=0;i<n-1;i++){
+		for(int j=0;j<n-i-1;j++){
+			if(a[j+1]<a[j]){
+					t=a[j+1];
+					a[j+1]=a[j];
+					a[j]=t;
+			}
+		}
+	}
+}
+
+ int main(){
+	int n;
+	cout<<"Enter the number of elements: ";
+	cin>>n;
+	int a[n];
+	cout<<"Enter the elements: ";
+	
+	for(int i=0;i<n;i++){
+		cin>>a[i];
+	}
+
+	bubble_sort(a,n);
+	
+	cout<<"Sorted array: ";
+	for(int i=0;i<n;i++){
+		cout<<a[i]<<" ";
+	}
+	cout<<endl;
+	
+	return 0;
+}   
\ No newline at end of file
diff --git a/hackerrank/Aray/ArraysIntroduction.cpp b/hackerrank/Aray/ArraysIntroduction.cpp
new file mode 100644
index 0000000..df228ba
--- /dev/null
+++ b/hackerrank/Aray/ArraysIntroduction.cpp
@@ -0,0 +1,36 @@
+/*
+	Arrays Introduction
+	
+	You will be given an array of  integers and you have to print the integers in the reverse order. 
+	
+	Sample Input
+
+	4
+	1 4 3 2
+	
+	Sample Output
+
+	2 3 4 1 
+  
+*/
+
+#include <iostream>
+
+using namespace std;
+
+
+int main() {
+    int n;
+    cin>>n;
+    int a[n];
+    for(int i=0;i<n;i++)
+    {
+        cin>>a[i];
+
+    }
+    for(int i=n-1;i>=0;i--){
+        cout<<a[i]<<"\t";
+    }
+
+    return 0;
+}
\ No newline at end of file