Subtract matrix

InsertionSorting.cpp

@@ -0,0 +1,47 @@
+// C++ program for insertion sort
+#include <bits/stdc++.h>
+using namespace std;
+
+/* Function to sort an array using insertion sort*/
+void insertionSort(int arr[], int n)
+{
+	int i, key, j;
+	for (i = 1; i < n; i++)
+	{
+		key = arr[i];
+		j = i - 1;
+
+		/* Move elements of arr[0..i-1], that are
+		greater than key, to one position ahead
+		of their current position */
+		while (j >= 0 && arr[j] > key)
+		{
+			arr[j + 1] = arr[j];
+			j = j - 1;
+		}
+		arr[j + 1] = key;
+	}
+}
+
+// A utility function to print an array of size n
+void printArray(int arr[], int n)
+{
+	int i;
+	for (i = 0; i < n; i++)
+		cout << arr[i] << " ";
+	cout << endl;
+}
+
+/* Driver code */
+int main()
+{
+	int arr[] = { 12, 11, 13, 5, 6 };
+	int n = sizeof(arr) / sizeof(arr[0]);
+
+	insertionSort(arr, n);
+	printArray(arr, n);
+
+	return 0;
+}
+
+

MatrixMultiply.cpp

@@ -0,0 +1,48 @@
+#include <iostream>  
+using namespace std;  
+int main()  
+{  
+int a[10][10],b[10][10],mul[10][10],r,c,i,j,k;    
+cout<<"enter the number of row=";    
+cin>>r;    
+cout<<"enter the number of column=";    
+cin>>c;    
+cout<<"enter the first matrix element=\n";    
+for(i=0;i<r;i++)    
+{    
+for(j=0;j<c;j++)    
+{    
+cin>>a[i][j];  
+}    
+}    
+cout<<"enter the second matrix element=\n";    
+for(i=0;i<r;i++)    
+{    
+for(j=0;j<c;j++)    
+{    
+cin>>b[i][j];    
+}    
+}    
+cout<<"multiply of the matrix=\n";    
+for(i=0;i<r;i++)    
+{    
+for(j=0;j<c;j++)    
+{    
+mul[i][j]=0;    
+for(k=0;k<c;k++)    
+{    
+mul[i][j]+=a[i][k]*b[k][j];    
+}    
+}    
+}    
+//for printing result    
+for(i=0;i<r;i++)    
+{    
+for(j=0;j<c;j++)    
+{    
+cout<<mul[i][j]<<" ";    
+}    
+cout<<"\n";    
+}    
+return 0;  
+}    

MergeSort.cpp

@@ -0,0 +1,98 @@
+// C++ program for Merge Sort
+#include <iostream>
+using namespace std;
+
+// Merges two subarrays of arr[].
+// First subarray is arr[l..m]
+// Second subarray is arr[m+1..r]
+void merge(int arr[], int l, int m, int r)
+{
+	int n1 = m - l + 1;
+	int n2 = r - m;
+
+	// Create temp arrays
+	int L[n1], R[n2];
+
+	// Copy data to temp arrays L[] and R[]
+	for (int i = 0; i < n1; i++)
+		L[i] = arr[l + i];
+	for (int j = 0; j < n2; j++)
+		R[j] = arr[m + 1 + j];
+
+	// Merge the temp arrays back into arr[l..r]
+
+	// Initial index of first subarray
+	int i = 0;
+
+	// Initial index of second subarray
+	int j = 0;
+
+	// Initial index of merged subarray
+	int k = l;
+
+	while (i < n1 && j < n2) {
+		if (L[i] <= R[j]) {
+			arr[k] = L[i];
+			i++;
+		}
+		else {
+			arr[k] = R[j];
+			j++;
+		}
+		k++;
+	}
+
+	// Copy the remaining elements of
+	// L[], if there are any
+	while (i < n1) {
+		arr[k] = L[i];
+		i++;
+		k++;
+	}
+
+	// Copy the remaining elements of
+	// R[], if there are any
+	while (j < n2) {
+		arr[k] = R[j];
+		j++;
+		k++;
+	}
+}
+
+// l is for left index and r is
+// right index of the sub-array
+// of arr to be sorted */
+void mergeSort(int arr[],int l,int r){
+	if(l>=r){
+		return;//returns recursively
+	}
+	int m =l+ (r-l)/2;
+	mergeSort(arr,l,m);
+	mergeSort(arr,m+1,r);
+	merge(arr,l,m,r);
+}
+
+// UTILITY FUNCTIONS
+// Function to print an array
+void printArray(int A[], int size)
+{
+	for (int i = 0; i < size; i++)
+		cout << A[i] << " ";
+}
+
+// Driver code
+int main()
+{
+	int arr[] = { 12, 11, 13, 5, 6, 7 };
+	int arr_size = sizeof(arr) / sizeof(arr[0]);
+
+	cout << "Given array is \n";
+	printArray(arr, arr_size);
+
+	mergeSort(arr, 0, arr_size - 1);
+
+	cout << "\nSorted array is \n";
+	printArray(arr, arr_size);
+	return 0;
+}
+

NumberTriangle.cpp

@@ -0,0 +1,25 @@
+#include <iostream>  
+using namespace std;  
+int main()  
+{  
+int i,j,k,l,n;    
+cout<<"Enter the Range=";    
+cin>>n;    
+for(i=1;i<=n;i++)    
+{    
+for(j=1;j<=n-i;j++)    
+{    
+cout<<" ";    
+}    
+for(k=1;k<=i;k++)    
+{    
+cout<<k;    
+}    
+for(l=i-1;l>=1;l--)    
+{    
+cout<<l;    
+}    
+cout<<"\n";    
+}    
+return 0;  
+} 

SubtractionMatrix.cpp

@@ -0,0 +1,43 @@
+// C++ program for subtraction of matrices
+#include <bits/stdc++.h>
+using namespace std;
+#define N 4
+
+// This function subtracts B[][] from A[][], and stores
+// the result in C[][]
+void subtract(int A[][N], int B[][N], int C[][N])
+{
+	int i, j;
+	for (i = 0; i < N; i++)
+		for (j = 0; j < N; j++)
+			C[i][j] = A[i][j] - B[i][j];
+}
+
+// Driver code
+int main()
+{
+	int A[N][N] = { {1, 1, 1, 1},
+					{2, 2, 2, 2},
+					{3, 3, 3, 3},
+					{4, 4, 4, 4}};
+
+	int B[N][N] = { {1, 1, 1, 1},
+					{2, 2, 2, 2},
+					{3, 3, 3, 3},
+					{4, 4, 4, 4}};
+
+	int C[N][N]; // To store result
+	int i, j;
+	subtract(A, B, C);
+
+	cout << "Result matrix is " << endl;
+	for (i = 0; i < N; i++)
+	{
+		for (j = 0; j < N; j++)
+		cout << C[i][j] << " ";
+		cout << endl;
+	}
+
+	return 0;
+}
+