public List <int> Sorting(List <int> unsortedList, AscendingOrDescending ds, SortEnum st)
{
List <int> _list;
switch (st)
{
case SortEnum.BubbleSort:
_list = this.Sorting(unsortedList, ds);
break;
//case SortEnum.MergeSort:
// break;
//case SortEnum.TallySort:
// break;
default:
_list = this.Sorting(unsortedList, ds);
break;
}
return(_list);
}
public static OrderingSyntax Ordering(AscendingOrDescending kind = default(AscendingOrDescending), ExpressionSyntax expression = null)
{
var result = new OrderingSyntax();
result.Kind = kind;
result.Expression = expression;
return result;
}
public List <int> Sorting(List <int> unsortedList, AscendingOrDescending ds)
{
List <int> sortedList = unsortedList;
//return unsortList; // // very poor implementation, does it meet the contract? Yes.
// Bubble Sort is one of the simpler sorting algorithms that works by
// repeatedly swapping the adjacent elements if they are in wrong order.
// 12, 5, 7, 10, 1, 160 arranged in ascending order are 1, 5, 7, 10, 12, 160. descending
// it opposite.
if (sortedList == null || sortedList.Count <= 1)
{
return(sortedList);
}
else
{
// ascending 1, 2, 100, 1233 ....
bool IsSwap = true;
while (IsSwap)
{
IsSwap = false;
for (int i = 0; i < sortedList.Count; i++)
{
if (i >= 1)
{
if (ds == AscendingOrDescending.Descending)
{
// step 1 compare 1st and 2nd element, if 1st in greater then 2nd, flip their positions
if (sortedList[i] > sortedList[i - 1]) // flip them
{
int temp = sortedList[i - 1];
sortedList[i - 1] = sortedList[i];
sortedList[i] = temp;
IsSwap = true;
}
// step 2 continue down the array position, comparing 2nd and 3rd. ...
}
else // ascending is the default 1, 2, 9 ...
{
// step 1 compare 1st and 2nd element, if 2st in greater then 1nd, flip their positions
if (sortedList[i] < sortedList[i - 1]) // flip them
{
int temp = sortedList[i];
sortedList[i] = sortedList[i - 1];
sortedList[i - 1] = temp;
IsSwap = true;
}
// step 2 continue down the array position, comparing 2nd and 3rd. ...
}
}
}
// step 3 continue this process until you got thru the loop entirely without
// ever flipping elements
// step 4 if no flip occurred, you're done and sorted
}
}
return(sortedList);
}
