public static bool GetSame(string word1, string word2)
{
if (word1.Length != word2.Length)
{
return(false);
}
return(StringSort.Get_SortedString(word1.ToUpper()) == StringSort.Get_SortedString(word2.ToUpper()));
}
public new void Sort()
{
string[] a = this.ToArray();
this.Clear();
//sort array and refill contents of this (faster than directly sorting List)
StringSort.Sort(a);
this.AddRange(a);
}
static void Main(string[] args)
{
System.Console.WriteLine("");
string numbers = Console.ReadLine();
var numbers_sum = new StringSort();
var result = numbers_sum.GetFormattedString(numbers);
System.Console.WriteLine(result);
}
public static TBL_WORDS Get_Word(TBL_WORDS[] list, string word)
{
word = word.ToUpper();
var result = (from s in list
where word.Length == s.WORD_LENGTH &&
s.ToString() == StringSort.Get_SortedString(word)
select s).FirstOrDefault();
return(result);
}
//----------------------------------------------
public static void Set_String_Eight()
{
string temp = "";
for (int i = 0; i < 8; i++)
{
temp += GetString_One();
}
AllList.Eight = StringSort.Get_SortedString(temp);;
}
public void BenchStringSort()
{
StringSort t = new StringSort();
t.numarrays = 40;
t.adjust = 1;
for (int i = 0; i < StringSortIterations; i++)
{
t.Run();
}
}
static void Main(string[] args)
{
var sb = new StringBuilder();
var stringSort = new StringSort();
Console.Write("Enter String : ");
string inputString = Console.ReadLine();
// var text = sb.Append("without,hello,bag,world").ToString();
string text = sb.Append(inputString).ToString();
var resultSort = stringSort.SortByAlphabetical(text);
Console.Write(resultSort);
}
public static void Set_NineList()
{
var temp = AllList.NineList;
temp.Clear();
foreach (string item in Letters.Letter)
{
string yeniString = StringSort.Get_SortedString(item + AllList.Eight);
if (!temp.Contains(yeniString))
{
temp.AddLast(yeniString);
}
}
}
static void Main(string[] args)
{
var builder = new StringBuilder();
var stringSort = new StringSort();
string words;
string allwords;
Console.Write("");
words = Console.ReadLine();
allwords = builder.Append(words).ToString();
var result = stringSort.SortByAlphabetical(allwords);
Console.Write(result);
}
private static void Set_LinkedList(LinkedList <string> temp, LinkedList <string> tempLess)
{
temp.Clear();
foreach (string item in Letters.Letter)
{
foreach (var item2 in tempLess)
{
string yeniString = StringSort.Get_SortedString(item + item2);
if (!temp.Contains(yeniString))
{
temp.AddLast(yeniString);
}
}
}
}
public static void BenchStringSort()
{
Setup();
StringSort t = new StringSort();
t.numarrays = 40;
t.adjust = 1;
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
for (int i = 0; i < StringSortIterations; i++)
{
t.Run();
}
}
}
}
//-------------------------------------------------------------
private static LinkedList <string> Get_LinkedList(string str)
{
LinkedList <string> temp = new LinkedList <string>();
for (int i = 0; i < str.Length; i++)
{
string tempString = "";
for (int j = 0; j < str.Length; j++)
{
if (i != j)
{
tempString += str[j].ToString();
}
}
tempString = StringSort.Get_SortedString(tempString);
if (!temp.Contains(tempString))
{
temp.AddLast(tempString);
}
}
return(temp);
}
public override string ToString()
{
return(StringSort.Get_SortedString(WORD));
}
public static void BenchStringSort()
{
Setup();
StringSort t = new StringSort();
t.numarrays = 1000;
t.adjust = 0;
foreach (var iteration in Benchmark.Iterations)
{
using (iteration.StartMeasurement())
{
for (int i = 0; i < StringSortIterations; i++)
{
t.Run();
}
}
}
}
static void SortTest1(string[] args)
{
CreateRandomFile(@"..\..\dic.txt");
string[] aArray = File.ReadAllLines(@"Rndm-dic.txt", Encoding.Default);
string[] bArray = File.ReadAllLines(@"Rndm-dic.txt", Encoding.Default);
List <string> aList = new List <string>(aArray);
List <string> sList = new List <string>(aArray);
List <string> sList2 = new List <string>(aArray);
SortTests.Sorting.sfList sList3 = new sfList(aArray);
KeyedList <string, int> kList = new KeyedList <string, int>(aArray.Length);
KeyedList <string, int> kListDesc = new KeyedList <string, int>(aArray.Length);
int val = 1;
foreach (string s in sList)
{
kList.Add(s, val); //val contains original line position of string
kListDesc.Add(s, val);
++val;
}
sList.Clear();
TimeCounter StopWatch = new TimeCounter();
StopWatch.SetOneProcessorAffinity();
Console.WriteLine("base Cycles = {0} IsHighRes = {1}", TimeCounter.Frequency, TimeCounter.IsHighResolution);
StopWatch.Start();
//List<string> cList = StringSort.Sort(aList);
List <string> cList = new List <string>(aList);
StopWatch.Stop();
Console.WriteLine("MS to sort copy: {0}", StopWatch.ElapsedMilSec);
int n = 0;
foreach (string s in cList)
{
Console.WriteLine(s);
if (++n > 1)
{
break;
}
}
aList.Clear();
StopWatch.StartNew();
Array.Sort <string>(bArray, CompareString);
StopWatch.Stop();
Console.WriteLine("MS to Array.Sort<string> bArray: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < bArray.Length; ++i)
{
Console.WriteLine(bArray[i]);
if (i == 1)
{
break;
}
}
//reset bArray to unsorted
aArray.CopyTo(bArray, 0);
StopWatch.StartNew();
StringSort.Sort(aArray);
StopWatch.Stop();
Console.WriteLine("MS to sort aArray: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < aArray.Length; ++i)
{
Console.WriteLine(aArray[i]);
if (i == 1)
{
break;
}
}
StopWatch.StartNew();
Sedgewick.Sort(ref bArray);
StopWatch.Stop();
Console.WriteLine("MS to Sedgewick Sort bArray: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < bArray.Length; ++i)
{
Console.WriteLine(bArray[i]);
if (i == 1)
{
break;
}
}
StopWatch.StartNew();
sList2.Sort(CompareString); //sort using List<string> method
//sList2.Sort(CompareString);
StopWatch.Stop();
Console.WriteLine("MS to List.Sort() sList2: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < sList2.Count; ++i)
{
Console.WriteLine(sList2[i]);
if (i == 1)
{
break;
}
}
sList2.Clear();
StopWatch.StartNew();
sList3.Sort(); //sort using StringSort replacement
StopWatch.Stop();
Console.WriteLine("MS to sfList.Sort() sList3: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < sList3.Count; ++i)
{
Console.WriteLine(sList3[i]);
if (i == 1)
{
break;
}
}
StopWatch.StartNew();
kList.Sort();
StopWatch.Stop();
Console.WriteLine("MS to KeyedList.Sort() kList: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < kList.Count; ++i)
{
Console.WriteLine(kList[i]);
if (i == 1)
{
break;
}
}
//test the sort
bool sorted = IsSortedTest(kList, kList.SortAscd);
Console.WriteLine("Test: kList is sorted = {0}", sorted);
kListDesc.SortAscd = false; //try sorting in descending order
StopWatch.StartNew();
kListDesc.Sort();
StopWatch.Stop();
Console.WriteLine("MS to KeyedList.Sort() kListDesc: {0}", StopWatch.ElapsedMilSec);
for (int i = 0; i < kListDesc.Count; ++i)
{
Console.WriteLine(kListDesc[i]);
if (i == 1)
{
break;
}
}
//test the sort
sorted = IsSortedTest(kListDesc, kListDesc.SortAscd);
Console.WriteLine("Test: kListDesc is sorted descending = {0}", sorted);
string[] wArray = File.ReadAllLines(@"Rndm-dic.txt", Encoding.Default);
//this is slower than stringSort
//WQSort wqs = new WQSort();
//StopWatch.StartNew();
//wqs.Sort(wArray);
//StopWatch.Stop();
//Console.WriteLine("MS to WQSort.Sort() wArray: {0}", StopWatch.ElapsedMilSec);
//for (int i = 0; i < wArray.Length; ++i)
//{
// Console.WriteLine(wArray[i]);
// if (i == 1) break;
//}
List <int> lstInt = new List <int>(wArray.Length);
Random rand = new Random((int)StopWatch.ElapsedMilSec);
for (int i = 0; i < wArray.Length; ++i)
{
lstInt.Add(rand.Next());
}
StopWatch.StartNew();
lstInt.Sort();
StopWatch.Stop();
Console.WriteLine("MS to List<int>.Sort() with {0} elements: {1:f1}", wArray.Length, StopWatch.ElapsedMilSec);
Console.WriteLine("First, Second, Last integer in sorted List");
Console.WriteLine(lstInt[0]);
Console.WriteLine(lstInt[1]);
Console.WriteLine(lstInt[wArray.Length - 1]);
StopWatch.RestoreProcessorAffinity(); //set this thread back to default Proccessor Affinity
}