Welcome to Software Development on Codidact!
Will you help us build our independent community of developers helping developers? We're small and trying to grow. We welcome questions about all aspects of software development, from design to code to QA and more. Got questions? Got answers? Got code you'd like someone to review? Please join us.
Post History
Question: There is a list of integers in an array (3,2,1,5,6,4), sort this list in both ASCENDING & DESCENDING order. Create a sort function. #include<stdio.h> #include<stdlib.h> ...
#2: Post edited
Question: There are a list of integers in an array (3,2,1,5,6,4), sort this list in both ASCENDING & DESSCENDING order. Create a sort function.*/- #include<stdio.h>
- #include<stdlib.h>
- void BubbleSort (int A[], int n, int (*compare)(int, int)){
int i,j,temp;for (i=0; i<n; i++){for(j=0; j<n-1; j++){if (compare(A[j], A[j+1]) > 0){ //regarding this line of codetemp = A[j];A[j] = A[j+1];A[j+1] = temp;}}}- }
`- int main (){
- int i, A[] = {3,2,1,5,6,4};
- BubbleSort(A,6);
- for (i=0; i<6; i++){
- printf("%d", A[i]);
- }
}`
- Question: There is a list of integers in an array (3,2,1,5,6,4), sort this list in both ASCENDING & DESCENDING order. Create a sort function.
- ```c
- #include<stdio.h>
- #include<stdlib.h>
- void BubbleSort (int A[], int n, int (*compare)(int, int)){
- int i,j,temp;
- for (i=0; i<n; i++){
- for(j=0; j<n-1; j++){
- if (compare(A[j], A[j+1]) > 0){ //regarding this line of code
- temp = A[j];
- A[j] = A[j+1];
- A[j+1] = temp;
- }
- }
- }
- }
- int main (){
- int i, A[] = {3,2,1,5,6,4};
- BubbleSort(A,6);
- for (i=0; i<6; i++){
- printf("%d", A[i]);
- }
- }
- ```
#1: Initial revision
What does the greater than 0 indicate in the case of this statement 'if (compare(A[j], A[j+1]) > 0)' ? Thank you.
Question: There are a list of integers in an array (3,2,1,5,6,4), sort this list in both ASCENDING & DESSCENDING order. Create a sort function.*/ #include<stdio.h> #include<stdlib.h> void BubbleSort (int A[], int n, int (*compare)(int, int)){ int i,j,temp; for (i=0; i<n; i++){ for(j=0; j<n-1; j++){ if (compare(A[j], A[j+1]) > 0){ //regarding this line of code temp = A[j]; A[j] = A[j+1]; A[j+1] = temp; } } } } ` int main (){ int i, A[] = {3,2,1,5,6,4}; BubbleSort(A,6); for (i=0; i<6; i++){ printf("%d", A[i]); } }`