diff --git a/mergesort b/mergesort
new file mode 100644
index 0000000..f77b32f
--- /dev/null
+++ b/mergesort
@@ -0,0 +1,47 @@
+# Python program for implementation of MergeSort 
+def mergeSort(arr): 
+    if len(arr) >1: 
+        mid = len(arr)//2 # Finding the mid of the array 
+        L = arr[:mid] # Dividing the array elements  
+        R = arr[mid:] # into 2 halves 
+  
+        mergeSort(L) # Sorting the first half 
+        mergeSort(R) # Sorting the second half 
+  
+        i = j = k = 0
+          
+        # Copy data to temp arrays L[] and R[] 
+        while i < len(L) and j < len(R): 
+            if L[i] < R[j]: 
+                arr[k] = L[i] 
+                i+= 1
+            else: 
+                arr[k] = R[j] 
+                j+= 1
+            k+= 1
+          
+        # Checking if any element was left 
+        while i < len(L): 
+            arr[k] = L[i] 
+            i+= 1
+            k+= 1
+          
+        while j < len(R): 
+            arr[k] = R[j] 
+            j+= 1
+            k+= 1
+  
+# Code to print the list 
+def printList(arr): 
+    for i in range(len(arr)):         
+        print(arr[i], end =" ") 
+    print() 
+  
+# driver code to test the above code 
+if __name__ == '__main__': 
+    arr = [12, 11, 13, 5, 6, 7]  
+    print ("Given array is", end ="\n")  
+    printList(arr) 
+    mergeSort(arr) 
+    print("Sorted array is: ", end ="\n") 
+    printList(arr) 
diff --git a/parwithsum b/parwithsum
new file mode 100644
index 0000000..b81776c
--- /dev/null
+++ b/parwithsum
@@ -0,0 +1,15 @@
+def printPairs(arr, arr_size, sum):
+     
+    # Create an empty hash set
+    s = set()
+     
+    for i in range(0, arr_size):
+        temp = sum-arr[i]
+        if (temp in s):
+            print "Pair with given sum "+ str(sum) + " is (" + str(arr[i]) + ", " + str(temp) + ")"
+        s.add(arr[i])
+ 
+# driver code
+A = [1, 4, 45, 6, 10, 8]
+n = 16
+printPairs(A, len(A), n)
diff --git a/pythoncode b/pythoncode
new file mode 100644
index 0000000..9f6b1b3
--- /dev/null
+++ b/pythoncode
@@ -0,0 +1,23 @@
+# Program to display the Fibonacci sequence up to n-th term
+
+nterms = int(input("How many terms? "))
+
+# first two terms
+n1, n2 = 0, 1
+count = 0
+
+# check if the number of terms is valid
+if nterms <= 0:
+   print("Please enter a positive integer")
+elif nterms == 1:
+   print("Fibonacci sequence upto",nterms,":")
+   print(n1)
+else:
+   print("Fibonacci sequence:")
+   while count < nterms:
+       print(n1)
+       nth = n1 + n2
+       # update values
+       n1 = n2
+       n2 = nth
+       count += 1
diff --git a/sliding_window_max b/sliding_window_max
new file mode 100644
index 0000000..f8e699b
--- /dev/null
+++ b/sliding_window_max
@@ -0,0 +1,16 @@
+def printMax(arr, n, k):
+    max = 0
+   
+    for i in range(n - k + 1):
+        max = arr[i]
+        for j in range(1, k):
+            if arr[i + j] > max:
+                max = arr[i + j]
+        print(str(max) + " ", end = "")
+ 
+# Driver method
+if __name__=="__main__":
+    arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+    n = len(arr)
+    k = 3
+    printMax(arr, n, k)