public List <int> InsertionSort(List <int> inputList) { for (int i = 0; i < inputList.Count - 1; i++) { for (int j = i + 1; j > 0; j--) { if (inputList[j - 1] > inputList[j]) { Utilitys.Swap(j - 1, j, ref inputList); } } } return(inputList); }
public List <int> BubbelSort(List <int> listToSort) { bool isChanged = false; do { isChanged = false; for (int i = 1; i < listToSort.Count; i++) { if (listToSort[i - 1] > listToSort[i]) { Utilitys.Swap(i - 1, i, ref listToSort); isChanged = true; } } } while (isChanged || sortor > 20); return(listToSort); }