• inspire_all

Edited Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Edited Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Edited Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Edited Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Edited Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Created Understanding quick sort algorithm and its worst case

Hello everyone,i think i know quick sort algorithm.But i need help in figuring out its worst case. Lets look at the below quicksort code----> void quicksort(int arr[],int low,int high) //low …
• inspire_all

Edited critical section and semaphore

What do you mean by a critical section? A critical section is a piece of code of a process that accesses a shared resource that must not be accessed by …
• inspire_all

Began Watching critical section and semaphore

What do you mean by a critical section? A critical section is a piece of code of a process that accesses a shared resource that must not be accessed by …
• inspire_all

Created critical section and semaphore

What do you mean by a critical section? A critical section is a piece of code of a process that accesses a shared resource that must not be accessed by …
• inspire_all

Marked Solved Status for hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Revoked Solved Status for hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Marked Solved Status for hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Replied To a Post in hashmap explanation

thanks a lot :)
• inspire_all

Replied To a Post in hashmap explanation

• inspire_all

Began Watching hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Edited hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Created hashmap explanation

Please can anybody explain me the following things below:: 1.What is a hashmap 2.Its use 3.What do we do to avoid collisions....
• inspire_all

Began Watching Rectangular queries

Problem: input:square matrix of order n and a query which will denote the submatrix.(x1,y1,x2,y2) output:no of distinct elements in this submatrix. constraint:time limit=1 sec this is what i tried #include<stdio.h> …
• inspire_all

Created Rectangular queries

Problem: input:square matrix of order n and a query which will denote the submatrix.(x1,y1,x2,y2) output:no of distinct elements in this submatrix. constraint:time limit=1 sec this is what i tried #include<stdio.h> …
• inspire_all

Replied To a Post in copy string at specified location

i don't want to overwrite the characters. i want to append the characters at the end.
• inspire_all

Replied To a Post in copy string at specified location

c
• inspire_all

Created copy string at specified location

suppose there are two strings str1 and str2. suppose i filled str1 with some characters.Now what i want to do is copying string str2 at some specified location in str1. …
• inspire_all

Created problem in accepting string via gets function in C

#include<stdio.h> #include<conio.h> int main() { char cyp[150],eng[26]; scanf("%s",eng); gets(cyp); getch(); return 0; } eng is accepted but only one letter is accepted for cyp.
• inspire_all

Replied To a Post in runtime error SIGSEGV for lowest sum

break down your data set into something manageable. How can i do this?
• inspire_all

Replied To a Post in runtime error SIGSEGV for lowest sum

i tried doing this #include<stdio.h> #include<stdlib.h> //#define MAX 10001 void quicksort(long long[],long long,long long); int partition(long long[],long long,long long); void swap(long long[],long long,long long); int main() { int t,k,q,i,j,qi,c; long …
• inspire_all

Replied To a Post in runtime error SIGSEGV for lowest sum

basically i posted the code on codechef.So i don't know for what input does it fail.But it works fine for small test cases.Now the constraints as i have mentioned above …
• inspire_all

Replied To a Post in runtime error SIGSEGV for lowest sum

still i am not getting it I have been working on it since 2 days now and still couldn't find anything
• inspire_all

Created runtime error SIGSEGV for lowest sum

#include<stdio.h> #include<stdlib.h> //#define MAX 10001 void quicksort(long long[],int,int); int partition(long long[],int,int); void swap(long long[],int,int); int main() { int t,k,q,i,j,qi,c,p; long long *mot,*sat,*res; //printf("Enter no of test cases"); scanf("%d",&t); for(i=0;i<t;i++) { …

The End.