Skip to content
Snippets Groups Projects
Select Git revision
  • e48924b57cd3dd2afba7122942909b21f332715f
  • master default protected
  • 2018ws
  • 2017ws
  • 2016ws
5 results

hello.c

Blame
  • Forked from Peter Gerwinski / hp
    Source project has a limited visibility.
    bsort-1a.c 1023 B
    #include <stdio.h>
    #include <string.h>
    #include <unistd.h>
    
    int comparisons = 0;
    
    void display (char **name, int left, int right)
    {
      printf ("\e[H\e[J");
      for (int i = 0; name[i]; i++)
        {
          printf ("%s", name[i]);
          if (i == left || i == right)
            printf (" <--");
          printf ("\n");
        }
      printf ("%d\n", comparisons);
    }
    
    int compare (char **name, int left, int right)
    {
      int result = strcmp (name[left], name[right]);
      comparisons++;
      display (name, left, right);
      usleep (200000);
      return result;
    }
    
    void sort (char **name)
    {
      for (int i = 1; name[i]; i++)
        if (compare (name, i - 1, i) > 0)
          {
            char *temp = name[i - 1];
            name[i - 1] = name[i];
            name[i] = temp;
          }
    }
    
    int main (void)
    {
      char *name[] = { "Otto", "Lisa", "Anna", "Heinrich", "Siegfried", "Peter",
                       "Dieter", "Hugo", "Zacharias", "Berta", "Maria", "Fritz", "Box", "Hans",
                       "Thomas", "Ulrich", NULL };
      sort (name);
      display (name, -1, -1);
      return 0;
    }