From ee518b4be9551e2e8e17d78ab4082a7ea15f3779 Mon Sep 17 00:00:00 2001
From: Kevin Worth <kworth@mac-mini.(none)>
Date: Mon, 29 Jan 2007 11:45:54 -0500
Subject: [PATCH] Attempt at implementing qsort into card_group_is_run

---
 kub.c | 37 +++++++++++++++++++++++++++++++++++--
 1 file changed, 35 insertions(+), 2 deletions(-)

diff --git a/kub.c b/kub.c
index aec86be..071fa5f 100644
--- a/kub.c
+++ b/kub.c
@@ -80,7 +80,40 @@ static int card_compare(card_t *card_one, card_t *card_two)
     return card_one->number - card_two->number;
 }
 
-static int card_group_is_run(card_group_t *card_group)
+
+/* If card_one < card_two, then return value will be negative
+   if they are equal, 0 will be returned,
+   if card_one > card_two, then return value will be positive */
+static int card_compare(card_t *card_one, card_t *card_two)
+{
+    return card_one->number - card_two->number;
+}
+
+static int card_group_is_run_one(card_group_t *card_group)
+{
+    int i;
+    qsort (card_group->cards[0].number, card_group->num_cards,
+	   card_group->cards[card_group->num_cards - 1],
+	   int(card_compare)(const void *, const void *) );
+	   
+    if (card_group->num_cards > 13 || card_group->num_cards < 3)
+    {
+	return 0;
+    }
+    for (i = 0; i < card_group->num_cards - 1; ++i)
+	if(card_group->cards[i].color != card_group->cards[i + 1].color)
+	{
+	    return 0;
+	}
+	if(card_group->cards[i].number != card_group->cards[i + 1].number -1)
+	{
+	    return 0;
+	}
+    return 1;
+}
+
+
+static int card_group_is_run_two(card_group_t *card_group)
 {
     int i;
     int lowest = 14, highest = 0;
@@ -91,7 +124,7 @@ static int card_group_is_run(card_group_t *card_group)
 	return 0;
     }
 
-    run_color = card_group->cards[i].color;
+    run_color = card_group->cards[0].color;
 
     for (i = 0; i < card_group->num_cards; i++)
     {
-- 
2.43.0