fork download
copy 
  1. //bubble sort
  2.  
  3. import java.util.*;
  4. import java.lang.*;
  5. import java.io.*;
  6.  
  7. class Ideone {
  8. 	public static void main (String[] args) throws java.lang.Exception {
  9. 		int [] arr = {65,43,32,21,12,34,45,76,99,86,33,66,22,88,10};
  10.  
  11.  
  12. 		BNode bNode = new bNode();
  13.  
  14. 		// bubbleSort(arr);
  15. 		// selectionSort(arr);
  16. 		// insertionSort(arr);
  17. 		// quickSort(arr, 0, (arr.length - 1));
  18.  
  19. 		// printArray (arr);
  20. 	}
  21.  
  22. 	public static void printArray (int [] arr) {
  23. 		for (int i = 0; i < arr.length; i++) {
  24. 			System.out.println(arr[i]);
  25. 		}
  26. 	}
  27.  
  28. 	public static void quickSort (int [] arr, int l, int r) {
  29. 		if (l == r) {
  30. 			return;
  31. 		}
  32. 		int pivot = l + ((r - l) / 2);
  33. 		System.out.println("pivot: " + pivot + ", " + arr[pivot]);
  34. 		int p1 = l;
  35. 		int p2 = r;
  36. 		int wall = l;
  37. 		swap (arr, pivot, r);
  38.  
  39. 		for (int i = l; i < r; i++) {
  40. 			if (arr[i] <  arr[r] && i < pivot) {
  41. 				swap (arr, wall + 1, i);
  42. 				wall++;
  43. 			}
  44. 			swap (arr, wall, r);
  45. 		}
  46. 		// quickSort (arr, l, pivot);
  47. 		// quickSort (arr, (pivot + 1), r);
  48.  
  49. 	}
  50.  
  51. 	public static void insertionSort (int [] arr) {
  52. 		for (int i = 1; i < arr.length; i++) {
  53. 			int temp = arr[i];
  54. 			int j = i - 1;
  55. 			for (; j >= 0; j--) {
  56. 				if (arr[j] > temp) {
  57. 					arr[j + 1] = arr[j];
  58. 				}
  59. 				else {
  60. 					break;
  61. 				}
  62. 			}
  63. 			arr[j] = temp;
  64. 		}
  65. 	}
  66.  
  67. 	public static void selectionSort (int [] arr) {
  68. 		for (int i = 0; i < arr.length; i++) {
  69. 			int min = arr[i];
  70. 			int index = i;
  71. 			for (int j = i+1; j < arr.length; j++) {
  72. 				if (arr[j] <= min) {
  73. 					min = arr[j];
  74. 					index = j;
  75. 				}
  76. 			}
  77. 			swap(arr, i, index);
  78. 		}
  79. 	}
  80.  
  81. 	public static void swap (int[] arr, int i, int j) {
  82. 		if (i != j) {
  83. 			arr[j] = arr[j] + arr[i];
  84. 			arr[i] = arr[j] - arr[i];
  85. 			arr[j] = arr[j] - arr[i];
  86. 		}
  87. 	}
  88.  
  89. 	public static void bubbleSort(int [] arr) {
  90. 		int sz = arr.length;
  91.  
  92. 		for (int i = 0; i < sz; i++) {
  93. 			for (int j = 0; j < i; j++) {
  94. 				if (arr[j] > arr[i]) {
  95. 					swap(arr, i, j);
  96. 				}
  97. 			}
  98. 		}
  99. 	}
  100. }
  101.  
  102. class BNode {
  103. 	int data;
  104. 	BNode left;
  105. 	BNode right;
  106.  
  107. 	public BNode (int data) {
  108. 		this.data = data;
  109. 	}
  110.  
  111. 	public void add () {
  112.  
  113. 	}
  114. }
Success #stdin #stdout 0.1s 320512KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
pivot: 7, 76
43
65
76
32
12
34
45
10
99
86
33
66
22
88
21
https://ideone.com/gTno8M
language:
Java (HotSpot 12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!