S

@sreebhavani_2325

Default Constructor

Java
1 year ago
class DefaultConstructor { int college_id; String college_name; String city; DefaultConstructor() { college_id=846; college_name="GRIET"; city="Hyderabad";

Radix sort

C
1 year ago
#include<stdio.h> void radixsort(int a[],int n); void display(int a[],int n); int main() { int a[10],i,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]);

Merge sort

C
1 year ago
#include<stdio.h> void display(int a[],int n); void mergesort(int a[],int ,int); void simplemerge(int a[],int ,int, int); int main() { int a[20],i,n; scanf("%d",&n); for(i=0;i<n;i++) {

Quick sort

C
1 year ago
#include<stdio.h> void display(int a[],int n); void quicksort(int a[],int lb,int ub); int main() { int i,n,a[200]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]);

Insertion sort

C
1 year ago
#include<stdio.h> void display(int a[],int n); void insort(int a[],int n); int main() { int a[20],i,j,n,temp,item; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]);

Selection sort

C
1 year ago
#include<stdio.h> int main() { int a[200],n,i,j,temp; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } printf("Unsorted List\n");

Bubble sort

C
1 year ago
#include<stdio.h> void display(int a[],int n); void bubblesort(int a[],int n); int main() { int a[200],i,n; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]);

CircularQ using array

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define queuesize 4 int q[queuesize]; void enqueue(int ); void dequeue(); void display(); int r=-1; int f=0; int count=0;

Q using array

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define queuesize 4 int q[queuesize]; void enqueue(int item); void dequeue(); void display(); int r=-1; int f=0; int main()

Stack using array

C
1 year ago
#include<stdio.h> #include<stdlib.h> void push(int s[],int item); int pop(int s[]); void display(); # define stacksize 4 int s[stacksize]; int top=-1; int main() {

Q using SLL

C
1 year ago
#include <stdio.h> #include <stdlib.h> struct node { int info; struct node *link; }; typedef struct node* NODE; NODE insert_rear(int ,NODE ); NODE delete_front(NODE );

Stack using SLL

C
1 year ago
#include <stdio.h> #include <stdlib.h> struct node { int info; struct node *link; }; typedef struct node* NODE; NODE insert_front(int ,NODE ); NODE delete_front(NODE );

DLL

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define MALLOC(p,n,type)\ p=(type*)malloc(n*sizeof(type));\ if(p==NULL)\ {\ printf("Insufficient memory\n");\ exit(0);\ } struct node

CLL

C
1 year ago
#include <stdio.h> #include <stdlib.h> struct node { int info; struct node *link; }; typedef struct node* NODE; NODE insert_front(int ,NODE ); NODE delete_front(NODE );

SLL

C
1 year ago
#include <stdio.h> #include <stdlib.h> struct node { int info; struct node *link; }; typedef struct node* NODE; NODE insert_front(int ,NODE ); NODE delete_front(NODE );

Adj matrix

C
1 year ago
#include <stdio.h> #define MAX 10 void getgraph(); void printgraph(); int G[MAX][MAX]; int n; int main() {

Hashing

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define HASH_SIZE 5 #define MALLOC(p,n,type)\ p=(type*)malloc(n*sizeof(type));\ if(p==NULL)\ {\ printf("insufficient memeory\n");\ exit(0);\

BFS traversal

C
1 year ago
#include<stdio.h> int a[10][10],s[10],n; void read_adjacency_matrix(int a[10][10],int n) { int i,j; for(i=0;i<n;i++) { for(j=0;j<n;j++) { scanf("%d",&a[i][j]);

DFS traversal

C
1 year ago
#include<stdio.h> int a[10][10],s[10],n; void read_adjacency_matrix(int a[10][10],int n) { int i,j; for(i=0;i<n;i++) { for(j=0;j<n;j++) {

Adj list

C
1 year ago
#include<stdio.h> #include<stdlib.h> #define MALLOC(p,n,type)\ p=(type*)malloc(n*sizeof(type));\ if(p==NULL)\ {\ printf("insufficient memeory\n");\ exit(0);\ }