public static void BinarySearchStDemo()
{
BinarySearchSt <char, int> bsst = new BinarySearchSt <char, int>(5);
//char ch = 'b';
//int num = 1;
//for (int i = 0; i < bsst.Capacity; i++)
//{
// Console.WriteLine(ch + " " + num);
// bsst.Add(ch++, num++);
//}
bsst.Add('c', 2);
bsst.Add('f', 5);
bsst.Add('b', 1);
bsst.Add('d', 3);
bsst.Add('e', 4);
Console.WriteLine(bsst.Count);
Console.WriteLine("Min, should be b: " + bsst.Min());
Console.WriteLine("Max, should be f: " + bsst.Max());
bsst.RemoveMin();
bsst.RemoveMax();
Console.WriteLine("Min, should be c: " + bsst.Min());
Console.WriteLine("Max, should be e: " + bsst.Max());
bsst.Add('b', 1);
bsst.Add('f', 5);
Console.WriteLine("Select index 2, should be d: " + bsst.Select(2));
Console.WriteLine("Select index 4, should be f: " + bsst.Select(4));
Console.WriteLine("Ceiling b, should be b: " + bsst.Ceiling('b'));
Console.WriteLine("Ceiling a, should be b: " + bsst.Ceiling('a'));
Console.WriteLine("Ceiling g, should be null: " + bsst.Ceiling('g'));
Console.WriteLine("Ceiling d, should be d: " + bsst.Ceiling('d'));
Console.WriteLine("Floor e, should be e: " + bsst.Floor('e'));
Console.WriteLine("Floor a, should be null: " + bsst.Floor('a'));
Console.WriteLine("Floor g, should be f: " + bsst.Floor('g'));
Console.WriteLine("Range b & f: ");
var range = bsst.Range('b', 'f');
//Console.WriteLine("Range a & f: ");
//array = bsst.Range('a', 'f');
//Console.WriteLine("Range e & h: ");
//array = bsst.Range('e', 'h');
//Console.WriteLine("Range b & c: ");
//array = bsst.Range('b', 'c');
//Console.WriteLine("Range g & h: ");
//array = bsst.Range('g', 'h');
Console.WriteLine("Range a & g: ");
range = bsst.Range('a', 'g');
foreach (var item in range)
{
Console.Write(item + " ");
}
}
/// <summary>
/// 测试方法，测试 BinarySearchST。
/// </summary>
/// <param name="st">用于测试的符号表。</param>
public static void Test(BinarySearchSt <string, int> st)
{
var test = "S E A R C H E X A M P L E";
var keys = test.Split(new[] { ' ' }, StringSplitOptions.RemoveEmptyEntries);
var n = keys.Length;
for (var i = 0; i < n; i++)
{
st.Put(keys[i], i);
}
Console.WriteLine("size = " + st.Size());
Console.WriteLine("min = " + st.Min());
Console.WriteLine("max = " + st.Max());
Console.WriteLine();
Console.WriteLine("Testing Keys()");
Console.WriteLine("-----------------------------------");
foreach (var s in st.Keys())
{
Console.WriteLine(s + " " + st.Get(s));
}
Console.WriteLine();
Console.WriteLine("Testing Select()");
Console.WriteLine("-----------------------------------");
for (var i = 0; i < st.Size(); i++) // 循环条件不能有 '='
{
Console.WriteLine(i + " " + st.Select(i));
}
Console.WriteLine();
Console.WriteLine("key Rank Floor Ceil");
Console.WriteLine("-----------------------------------");
for (var i = 'A'; i <= 'Z'; i++)
{
var s = i + "";
Console.WriteLine($"{s} {st.Rank(s)} {st.Floor(s)} {st.Ceiling(s)}");
}
Console.WriteLine();
for (var i = 0; i < st.Size() / 2; i++)
{
st.DeleteMin();
}
Console.WriteLine("After deleting the smallest " + st.Size() / 2 + " keys");
Console.WriteLine("-----------------------------------");
foreach (var s in st.Keys())
{
Console.WriteLine(s + " " + st.Get(s));
}
Console.WriteLine();
while (!st.IsEmpty())
{
st.Delete(st.Select(st.Size() / 2));
}
Console.WriteLine("After deleting the remaining keys");
Console.WriteLine("-----------------------------------");
// 异常处理
try
{
foreach (var s in st.Keys())
{
Console.WriteLine(s + " " + st.Get(s));
}
}
catch (Exception ex)
{
Console.WriteLine("Exception: " + ex.Message);
}
Console.WriteLine();
Console.WriteLine("After adding back N keys");
Console.WriteLine("-----------------------------------");
for (var i = 0; i < n; i++)
{
st.Put(keys[i], i);
}
foreach (var s in st.Keys())
{
Console.WriteLine(s + " " + st.Get(s));
}
Console.WriteLine();
}
