[ad_1]
\n<\/p>\n
So, you don’t want to sort your array after all ?<\/p>\n
Well, this is the code to “remove” all the zero in an array.
\nSince you changed many time your question, I don’t know if it will be the rigth answer.<\/p>\n
If you have question, do not hesitate.
\nThe algorithm used below is a commom algorithm : recopy the array with an offset.<\/p>\n
#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\n\nvoid Array_Display(const int * const array, const size_t size)\n{\n for (size_t i = 0; i < size; ++i) {\n printf(\"%d\", array[i]);\n if (i + 1 < size) {\n printf(\", \");\n }\n }\n printf(\"\\n\");\n}\n\nvoid Array_MagicFunction(int * const array, size_t *size)\n{\n size_t j = 0;\n\n for (size_t i = 0; i < *size; ++i) {\n if (array[i] != 0) {\n array[j] = array[i];\n ++j;\n }\n }\n *size = j;\n}\n\n#define ARRAY_SIZE 10\n\nint main(void)\n{\n int array[ARRAY_SIZE] = {1,2,513,0,4,5,6,0,0,9};\n size_t size = ARRAY_SIZE;\n\n\n Array_Display(array, size);\n\n Array_MagicFunction(array, &size);\n\n Array_Display(array, size);\n\n return (EXIT_SUCCESS);\n}\n<\/code><\/pre>\nI keep my first answer in case you still want to sort your array.<\/p>\n
———-<\/h2>\n
Edit : Attention please.
\nThe provided code below doesn’t work for Jackdon for some mysterious reasons.
\nIt seem that his implementation of qsort is bugged (which is really surprising consedering a bug in a massive used function is higlhy improbable) : even when the function return the correct value, the array is not sorted …<\/p>\n
I don’t understand what’s going on, I’m pretty sure that my code is correct (and it work on Debian9), so I just put some poor “debugging”.
\nJackdon environment is the following :<\/p>\n
\n- Windows 10<\/li>\n
- Microsoft Visual Studio 2017 Community<\/li>\n
- the compile setting is follow default<\/li>\n<\/ul>\n
\nTom’s To Jackdon :<\/p>\n
\nCould you please replace the intcmp function with this ?<\/p>\n
int intcmp(const void *first, const void *second)\n{\n const int *firstInt = first;\n const int *secondInt = second;\n int result;\n\n if (*firstInt == 0) {\n result = 1;\n } else {\n result = (*firstInt) - (*secondInt);\n }\n\n printf(\"POOR DEBUG : \");\n for (size_t i = 0 ; i < ARRAY_SIZE; ++i) {\n printf(\"%d \", array[i]);\n }\n printf(\"\\ncomparing %d to %d : %d\\n\", *firstInt, *secondInt, result);\n\n return (result);\n}\n<\/code><\/pre>\n<\/blockquote>\n
\nJackdon To Tom’s<\/p>\n
\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 1 to 5 : -4\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 1 to 9 : -8\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 5 to 9 : -4\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 2 to 5 : -3\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 3 to 5 : -2\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 0 to 5 : 1\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 0 to 5 : 1\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 0 to 5 : 1\nPOOR DEBUG : 1 2 3 0 4 5 6 0 0 9\ncomparing 6 to 5 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 4 to 5 : -1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 5 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 4 to 5 : -1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 4 to 5 : -1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 6 to 0 : 6\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 6 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 0 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 9 to 0 : 9\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 6 to 0 : 6\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 6 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 0 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 6 to 0 : 6\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 0 to 6 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 6 to 0 : 6\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 2 to 1 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 3 to 2 : 1\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 5 to 3 : 2\nPOOR DEBUG : 1 2 3 5 4 0 6 0 0 9\ncomparing 4 to 5 : -1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 2 to 1 : 1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 3 to 2 : 1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 4 to 3 : 1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 2 to 1 : 1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 3 to 2 : 1\nPOOR DEBUG : 1 2 3 4 5 0 6 0 0 9\ncomparing 2 to 1 : 1\n1 2 3 4 5 0 6 0 0 9\n<\/code><\/pre>\n<\/blockquote>\n———-<\/h2>\n
Use qsort.<\/p>\n
#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\n\nint intcmp(const void *first, const void *second)\n{\n const int *firstInt = first;\n const int *secondInt = second;\n\n if (*firstInt == 0) {\n return (1);\n }\n return (*firstInt - *secondInt);\n}\n\n#define ARRAY_SIZE 10\n\nint main(void)\n{\n int array[ARRAY_SIZE] = {1,2,3,0,4,5,6,0,0,9};\n\n qsort(array, ARRAY_SIZE, sizeof(*array), intcmp);\n\n for (size_t i = 0 ; i < ARRAY_SIZE; ++i) {\n printf(\"%d \", array[i]);\n }\n printf(\"\\n\");\n\n return (EXIT_SUCCESS);\n}\n<\/code><\/pre>\nThe “removing zero” part is handled by putting all zero at the end of the array. So your final array length will simply be found by searching the index of the first zero in the array (don’t forget to take care if there is no 0 is the array to begin with).<\/p>\n<\/p><\/div>\n