1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199
| using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Collections;
namespace ConsoleApplication4 { class Program { static void Main(string[] args) { int nums = 100; CArray mynums = new CArray(nums); Random rand = new Random();
for (int i = 0; i < nums; i++) { mynums.Insert(rand.Next(100)); }
mynums.DisplayElements();
mynums.SeqSearch(50); mynums.BinSearch(50);
mynums.DisplayElements();
Console.ReadKey(); } }
class CArray { private int upper; private int numElements; private int[] arr; private int compCount;
public CArray(int length) { upper = length-1; arr = new int[length]; numElements = 0; }
public void Insert(int item) { arr[numElements] = item; numElements += 1; }
public void Clear() { for (int i = 0; i < upper; i++) { arr[i] = 0; } numElements = 0; }
public void DisplayElements() { StringBuilder str = new StringBuilder();
for (int i = 0; i <= upper; i++) { str.AppendFormat("{0}\t", arr[i]); }
Console.Write(str); }
public void BubbleSort() { int temp; for (int outer = upper; outer >= 1; outer--) { for (int inner = 0; inner < outer-1; inner++) { if (arr[inner] > arr[inner + 1]) { temp = arr[inner + 1]; arr[inner + 1] = arr[inner]; arr[inner] = temp; } }
this.DisplayElements(); } }
public void SelectionSort() { int low,temp; for (int outer = 0; outer <upper; outer++) { low = outer; for (int inner = outer+1; inner < upper; inner++) { if (arr[low] > arr[inner]) { low = inner; } } temp = arr[outer]; arr[outer] = arr[low]; arr[low] = temp;
this.DisplayElements(); } }
public void InsertionSort() { int inner, temp; for (int outer = 1; outer <=upper; outer++) { temp = arr[outer]; inner=outer; while (inner > 0 && temp <= arr[inner - 1]) { arr[inner] = arr[inner - 1]; inner-=1; } arr[inner] = temp;
} }
public bool SeqSearch(int value) { int times = 0, last = 0; compCount = 0; for (int i = 0; i < upper; i++) { compCount += 1; if (arr[i] == value) { times+=1; last = i; Console.WriteLine("The {0} times index is {1}.", times, i); } } if (times > 0) { Console.WriteLine("The last index is {0},compCount is {1}.", last,compCount); return true; } else { Console.WriteLine("None,compCount is {0}.",compCount); return false; } }
public void BinSearch(int value) { int upperBound, lowerBound, mid; upperBound = upper; lowerBound = 0; compCount = 0; while (lowerBound <= upperBound) { mid = (lowerBound + upperBound) / 2; compCount += 1; if (arr[mid] == value) { Console.Write("{0} 's index is {1},compCount is {2}\n", value, mid,compCount); return; } else if (value < arr[mid]) { upperBound = mid - 1; } else { lowerBound = mid + 1; } } Console.Write("{0} 's index is {1},compCount is {2}\n",value, -1,compCount); }
public void Bsearch(int value) { Console.Write("{0} 's index is {1}\n", value, Array.BinarySearch(arr, value)); }
} }
|