scanf("%d", addr);
}
-// The efficience of this swap alternative is debatable ..
+// The efficiency of this swap alternative is debatable ..
void xorSwap (int *v1, int *v2) {
if (v1 != v2) {
*v1 ^= *v2;
bool sortFirst(int* array, int length) {
bool rt = false;
+ // This loop could probably be replaced by a while loop with conditions
+ // on the array values permutation AND the iteration value, later ...
for (int i = 0; i < length-1; i++) {
if (array[i] > array[i+1]) {
swap(&array[i], &array[i+1]);
//xorSwap(&array[i], &array[i+1]);
- rt = true;
+ if (!rt) { rt = true; };
}
}
return rt;
int main() {
int tab_length = 10;
- // GCC do not like variable sized array, even with the size variable properly initialized
- int tab[10] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
+ int tab[tab_length];
+ for (int i = 0; i < tab_length; i++) {
+ tab[i] = 0;
+ }
for (int i = 0; i < tab_length; i++) {
printf("Enter integer value at array's index[%d]? ", i);