Answer Posted / alex r.

Single parse, n/2 steps.
Swapping without 3rd tmp variable.

#include <stdio.h>
int main(void)
{
int i,j;
int stepscount = 0;
int length = 10;
int a[10] = {1,0,0,0,1,0,0,1};
for (i=0,j=length-1;i<j;stepscount++)
{
// dont need move 0 from the start
if (a[i] == 0) i++;
// dont need move 1 from the end
if (a[j] == 1) j--;
// swap 0 and 1
if (a[i] > a[j]) {
a[i] = a[i] ^ a[j];
a[j] = a[j] ^ a[i];
a[i] = a[i] ^ a[j];
i++;
j--;
}
}
for (i = 0; i < length; i++)
{
printf("%d",a[i]);
}
printf("\nSteps: %d\n", stepscount);
return 0;
}

What is linear search?

1124

---

Why doesn't C support function overloading?

2718

---

Why static is used in c?

1079

---

What is the right way to use errno?

1038

---

WRITE A CODE IN C TO SEARCH A FILE FROM NOTEPAD FILE.

2434

---

How to establish connection with oracle database software from c language?

2181

---

Devise a program that inputs a 3 digit number n and finds out whether the number is prime or not. Find out its factors.

1116

---

#include main() { char s[] = "Bouquets and Brickbats"; printf(" %c, ",*(&s[2])); printf("%s, ",s+5); printf(" %s",s); printf(" %c",*(s+2)); }

1121

---

Write a program to find factorial of a number using recursive function.

1109

---

What is New modifiers?

1105

---

Explain why c is faster than c++?

1056

---

why return type of main is not necessary in linux

2091

---

Why is python slower than c?

1064

---

Is there a way to have non-constant case labels (i.e. Ranges or arbitrary expressions)?

1053

---

In C language what is a 'dangling pointer'?

1118

---