Merge pull request #569 from nirmay0503/master

I added algorithm for jump search !!

Math/factorial.cpp

@@ -0,0 +1,18 @@
+#include<iostream>
+using namespace std;
+
+int main()
+{
+    int n;
+    cout<<"Enter number = ";
+    cin>>n;
+    int num=1;
+    for(int i=1;i<n;i++)
+    {
+        num*=i;
+    }
+    cout<<"Factorial of number is = ";
+    cout<<num<<endl;
+
+    return 0;
+}

Search/jump_search.cpp

@@ -0,0 +1,54 @@
+// C++ program to implement Jump Search
+
+#include <bits/stdc++.h>
+using namespace std;
+
+int jumpSearch(int arr[], int x, int n)
+{
+    // Finding block size to be jumped
+    int step = sqrt(n);
+
+    // Finding the block where element is
+    // present (if it is present)
+    int prev = 0;
+    while (arr[min(step, n)-1] < x)
+    {
+        prev = step;
+        step += sqrt(n);
+        if (prev >= n)
+            return -1;
+    }
+
+    // Doing a linear search for x in block
+    // beginning with prev.
+    while (arr[prev] < x)
+    {
+        prev++;
+
+        // If we reached next block or end of
+        // array, element is not present.
+        if (prev == min(step, n))
+            return -1;
+    }
+    // If element is found
+    if (arr[prev] == x)
+        return prev;
+
+    return -1;
+}
+
+// Driver program to test function
+int main()
+{
+    int arr[] = { 0, 1, 1, 2, 3, 5, 8, 13, 21,
+                34, 55, 89, 144, 233, 377, 610 };
+    int x = 55;
+    int n = sizeof(arr) / sizeof(arr[0]);
+
+    // Find the index of 'x' using Jump Search
+    int index = jumpSearch(arr, x, n);
+
+    // Print the index where 'x' is located
+    cout << "\nNumber " << x << " is at index " << index;
+    return 0;
+}