1,2,3,4 5,6,1,2 3,4,5,6 1,2,3,4 5,6,1,2 1,2,3,4 int[] arr = {1,2,3,4,5,6 }; int len = arr.Length; int loop = 7; int printlen = 4; int presentlength = 0; int previndex = 0; int s = 0; for (int i=0;i< loop; i++) { if (previndex > 0 && previndex < 5) ...
//O(n square) in average and worst case senario //O(n) in best case senario public static Array BubbleSort(int[] arr,int n) { for(int i=0;i<n-1;i++) { for(int j=0;j<n-i-1;j++) { if(arr[j]>arr[j+1]) { int temp = arr[j]; arr[j] = arr[j + 1]; arr[j + 1] = temp; } ...
Comments
Post a Comment