diff --git a/algorithms/CPlusPlus/Arrays/Largest-smallest.cpp b/algorithms/CPlusPlus/Arrays/Largest-smallest.cpp
new file mode 100644
index 00000000..17b9829f
--- /dev/null
+++ b/algorithms/CPlusPlus/Arrays/Largest-smallest.cpp
@@ -0,0 +1,20 @@
+#include <iostream>
+#include <algorithm>
+using namespace std;
+
+//simple approach:
+//sort the array in ascending order.
+//the first element would be the smallest and the last element would be the largest
+
+int main()
+{
+    int arr[]={1,2,3,4,5};
+    int n=sizeof(arr)/sizeof(arr[0]);
+    cout<<n<<endl;
+    sort(arr,arr+n);//sorting the array
+    //sort(a,a+n)-->a is the name of the array and n is the size of array a
+    cout<<arr[0]<<" --> smallest number "<<endl;
+    cout<<arr[n-1]<<" --> largest number "<<endl;
+
+    return 0;
+}
\ No newline at end of file
diff --git a/algorithms/CPlusPlus/README.md b/algorithms/CPlusPlus/README.md
index 00f62f34..064a599b 100644
--- a/algorithms/CPlusPlus/README.md
+++ b/algorithms/CPlusPlus/README.md
@@ -33,7 +33,7 @@
 - [Sparse Matrix](Arrays/sparse_matrix.cpp)
 - [Balanced Parenthesis](Arrays/balanced-parenthesis.cpp)
 - [Find special index](Arrays/specialindex2.cpp)
-
+- [Largest and smallest number in an array](Arrays/Largest-smallest.cpp)
 
 ## Dynamic-Programming