Skip to content
Snippets Groups Projects
Select Git revision
  • 0ba264323975d1dc4dd71499afc9d06ee4ce3d5e
  • master default
2 results

sort-2.c

Blame
  • Forked from Peter Gerwinski / hp
    328 commits behind the upstream repository.
    sort-2.c 994 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;
    }
    
    int find_first (char **name)
    {
      int first = 0;
      for (int i = 1; name[i]; i++)
        if (compare (name, i, first) < 0)
          first = i;
      return first;
    }
    
    int main (void)
    {
      char *name[] = { "Otto", "Lisa", "Anna", "Heinrich", "Siegfried", "Peter",
                       "Dieter", "Hugo", "Berta", "Maria", "Fritz", "Box", "Hans",
                       "Thomas", "Ulrich", "Zacharias", NULL };
      int first = find_first (name);
      display (name, first, -1);
      return 0;
    }