How to implement bubble sorting with pointers

霓裳羽翼

In C language, using pointers to implement bubble sort, how should I write it. Thank you for waiting online

babyblock

#include <stdio.h>
main ()
{
 int n, i, j, * temp, * p, num;
 printf ("input sum of the numbers\n");
 scanf ("% d",&n);
 num = n;
 printf ("input numbers n <% d", num);
 printf ("\n");
 for (i = 0; i <n; i ++) scanf ("% d", p + i);
 getchar ();
 for (i = 0; i <n; i ++)
  for (j = 0; j <n-i; j ++)
   if (* (p + j + 1) <* (p + j))
    (* temp = * (p + j); * (p + j) = * (p + j + 1); * (p + j + 1) = * temp;) / * bubble exchange * /
 printf ("the sort:\n");
 for (i = 0; i <n; i ++) printf ("% d", * (p + i));
 printf ("\n");
 getchar ();
}

babyblock

Never adjusted
I hope everyone corrects it!

gwf17445

FT. Basic Skills

帝王至尊

typedef struct node
{
  int data;
} Node;
typedef int (* compare) (void *, void *); // This is a comparison function, just like the comparison function in the library sort function
void sort (Node * h [], int n, compare fun) // h [] puts an array pointing to Node
{
  int i, j;
  Node * tmp;

  for (i = 1; i <n; i ++)
  {
       for (j = i; j <n; j ++)
       {
            if (fun (h [j-1], h [j]))
            {
                  tmp = h [j-1];
                  h [j-1] = h [j];
                  h [j] = tmp;
             }
       }
  }
}
Wrote it myself

追求技术的ss

Ok..

xiaoshan

I don't have tools in my hand, but it seems to be a problem!