Gunjan_1

hello guys. I have recently learnt C in my course. It is a base language. If you want to learn c with the base then E balagurursamy is the best writer for it. And never depend on only one source. Instead of search it on many websites then prepare your …

Hey i am using the code of selection sort like this: #include<stdio.h> #include<conio.h> void selection(int a[],int n) { int i,j,temp; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(a[i]>a[j]) { temp=a[i]; a[i]=a[j]; a[j]=a[i]; } } } } Can this code be used?

What is the difference between access modifier, modifier and qualifier? It's a competition exam question. and is a very important question from exam point of view. plz help me to get the answer of this question.

what is accessor and mutator ?? and what is overloading of accessor and mutator?? Plz explain...

hey i m not to swap data. I m to swap nodes means direct pointers. Our teacher said that swapping data of nodes is not an efficient method.

Hey I am a student and i m performing selection sort in this way. Is it proper way or not? if it is not proper, explain it why with reason. #include<stdio.h> #include<conio.h> void selection(int a[],int n) { int i,j,temp; for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(a[i]>a[j]) { temp=a[i]; a[i]=a[j]; a[j]=a[i]; } } …

ok. and what is meant by your this line that you can help contribute to a list like that if i would like.