C language interview questions solution for freshers beginners placement tricky good pointers answers explanation operators data types arrays structures functions recursion preprocessors looping file handling strings switch case if else printf advance linux objective mcq faq online written test prime numbers Armstrong Fibonacci series factorial palindrome code programs examples on c++ tutorials and pdf

yes it would give the desired result, but it will also increase the number of comparisons. run your code with an example and the given code with the same example, you'll see the difference

for those who don't understand s-2 concept, here it is. The total no. of elements is stored in variable S (let S=5). But in array the first element is stored in position a[0]. Hence the last element (i.e. 5th element) is stored in a[4]. Now i=S-2 ==> i=a[3].. Then if j<=i, then when j becomes equal to i (i.e. a[3]), the term j+1=[4] (i.e. the last term.

If i wud write the loop as

ReplyDeletefor(i=0 to <s)

{ for(j=0 to<s-i)

{ j=i +1;

swap(a[j],a[j+1]);

}

)

den wud it give desired result?

no i think

Deleteyes it would give the desired result, but it will also increase the number of comparisons.

ReplyDeleterun your code with an example and the given code with the same example, you'll see the difference

Can u please explain how would it give the result that too when there is no use of if condition made?

DeleteGreat tutorial

ReplyDeleteTanx :)

Why this is used?

ReplyDeletefor(i=s-2;

s-2 is the second last element of d array ... and we are checking it out with j+1. that's why we have used s-2

Deletebecome a contributor of ISeenLab and help us to educate our friends globally

Deletebut the first loop start at the end of the array, if you say s-2 how you will reach the last element in taht array

ReplyDeleteyeah absolutely right how to do for last element

Deleteya i too have the dougt abt the same

Deletein assending or desssinding order???

ReplyDeletecan you explain me this program in details?

ReplyDeletehi ,what u want to ask in this prog,i can explain if you are interested..

DeleteCan u tell me the time complexity for the program "Bubble sort using c program"???

ReplyDeleteIt remains same Big O(n^2)..U can run the program for 30 elements with a loop Counter to get a clear idea..Below 30 results will be confusing

Deletethis code is wrong ...atleast write exact code :(

ReplyDeleteUse for(i=0;i<s-1;i++)

{

for(j=0;j<s-i-1;j+)

i cant understand this s-2 and j+1.. could u pls explain me

ReplyDeletei=s-2 marks the second last element and when j+1 reaches to i it checks the next value(last value) in array so that gets compared too..

Deletecan u explain me the algorithm of this bubble sort

ReplyDeletethis program is using arrays... what can i do for a bubble sort program using functions??

ReplyDeletehey,.. this program is using array,.. what can i do to use bubblesort using functions..???

ReplyDeletehi can u explain me the details of this code. I'm very interested in programming.I ll be very pleased if u help me !!

ReplyDeletefor those who don't understand s-2 concept, here it is. The total no. of elements is stored in variable S (let S=5). But in array the first element is stored in position a[0]. Hence the last element (i.e. 5th element) is stored in a[4]. Now i=S-2 ==> i=a[3].. Then if j<=i, then when j becomes equal to i (i.e. a[3]), the term j+1=[4] (i.e. the last term.

ReplyDeletei cant understand the loop hre

ReplyDeleteThis comment has been removed by the author.

ReplyDeleteThis comment has been removed by the author.

ReplyDeletehow to display my output by showing my each iteration process..???

ReplyDeleteunderstand the whole program plzzzz

ReplyDeleteEasy to understand. ...

ReplyDeletehow to generate floyd triangle using while and if in c

ReplyDeleteplease reply fastly

ReplyDelete