Question 44
The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 5, 13 in ascending order, using bubble sort is
Question 45
Question 46
main( ) { int a = 10; if ((fork ( ) == 0)) a++; printf (“%d\\n”, a ); }
Question 47
Question 48
void swap ( int x, int y ) { int tmp; tmp = x; x= y; y = tmp; }In order to exchange the values of two variables a and b:
There are 78 questions to complete.