@gayatrishelke

#include <iostream> using namespace std; void quick(int arr[],int first,int last) { while(first<last) { int i=first; int j=last; int pivot=first; while(i<=j)

#include <stdio.h> #include<stdlib.h> #include<pthread.h> #define ROW 2 #define COL 2 int mat1[ROW][COL]={{2,3},{4,5}}; int mat2[ROW][COL]={{6,7},{9,3}}; int result[ROW][COL];

#include <bits/stdc++.h> using namespace std; void primMST(vector<vector<int>> graph) { int v = graph.size(); vector<int> parent(v); vector<int> key(v); vector<bool> vis(v); priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>> pq;

#include <bits/stdc++.h> using namespace std; #define V 4 int travllingSalesmanProblem(int graph[][V], int s) { vector<int> vertex;

#include <bits/stdc++.h> using namespace std; class DSU { int* parent; int* rank; public:

#include <iostream> #include <limits.h> #include <vector> using namespace std; struct Edge { int source, destination, weight; };

#include <bits/stdc++.h> using namespace std; #define N 4 int ld[30] = { 0 }; int rd[30] = { 0 }; int cl[30] = { 0 }; void printSolution(int board[N][N]) { for (int i = 0; i < N; i++) {

#include<iostream> using namespace std; void quick(int arr[],int first,int last) { if(first<last) { int i=first; int j=last; int pivote=first; int temp=0;

#include <iostream> using namespace std; int main() { int arr[3]={2,3,4}; for(int i=0;i<3;i+=2) { if((i+1)<3) { swap(arr[i],arr[i+1]);

#include <iostream> using namespace std; void reverse(int arr[],int n) { int start=arr[0]; int end=arr[n-1]; while(start<=end) { swap(start,end); start++;

#include <iostream> using namespace std; void merge(int A[], int start, int mid, int end) { int p = start, q = mid + 1; int Arr[end - start + 1], k = 0; // Merging the two halves into Arr

#include <iostream> using namespace std; int quick(int a[], int first, int last) { if (first < last) { int i = first+1; int j = last; int pivot = first; int temp;

#include <iostream> using namespace std; bool quickSort(int arr[], int first, int last) { if (first < last) { int pivot = first; int i = first; int j = last; int temp; while (i < j)

mylist=[10,40,50,20,30,10,40,20] yourlist=['saw','small','foxes','he','six'] mylist.append(60) print(mylist) mylist.sort() print(mylist) mylist.reverse() print(mylist) mylist.insert(2,70) print(mylist)

#include <iostream> using namespace std; class exception1 { int car,age; char city[20]; public: void getdata() { cout<<"enter the age"<<endl;

#include <iostream> using namespace std; class BB; class AA { int a1; public: void getdata(int l) { a1=l;

#include <iostream> using namespace std; class manager { int salary,age; char name [30]; public: void getdata() { cout<<"enter the name "<<endl;

#include <iostream> using namespace std; double volume(int length) { return length*length*length; } double volume(int radius,int height) { return 4/3*3.14*radius*radius*height; }

#include<iostream> using namespace std; class student { int res,id; public: void getdata(int sid,int sres) { id=sid; res=sres;

#include<iostream> using namespace std; int recurse(int b,int p) { if(p==0) { return 1; } else if(p==1) {