Data STructure LAb 9
#include <iostream> using namespace std; void merge(int left[],int right[],int arr[],int mid,int lengthmid); int count=0; //factorial int fact(int n) { if(n==0) return 1; else return fact(n-1)*n; } int fibon(int n) { if(n==0) return 0; if(n==1) return 1; else return fibon(n-2)+fibon(n-1); } //merge sort void mergesort(int arr[],int low,int high) { int length=low+high; int mid=length/2; int left[mid]; int right[length-mid]; if(length<2) return ; for(int i=0;i<mid;i++) left[i]=arr[i]; for(int j=mid;j<length;j++) right[j-mid]=a...