private static void Sortingbydifference() {
		// TODO Auto-generated method stub
		int i = 0;
		int j = 0;
		for (i = 0; i < 10000; i++) {
			for (j = 0; j < 9999; j++) {

				if (jobs[j][2] < jobs[j + 1][2]) {
					int l, m, n;
					l = jobs[j][0];
					m = jobs[j][1];
					n = jobs[j][2];
					jobs[j][0] = jobs[j + 1][0];
					jobs[j][1] = jobs[j + 1][1];
					jobs[j][2] = jobs[j + 1][2];
					jobs[j + 1][0] = l;
					jobs[j + 1][1] = m;
					jobs[j + 1][2] = n;
				} else {
					if (jobs[j][2] == jobs[j + 1][2]) {

						if (jobs[j][0] < jobs[j + 1][0]) {
							float l, m, n;
							l = jobs[j][0];
							m = jobs[j][1];
							n = jobs[j][2];
							jobs[j][0] = jobs[j + 1][0];
							jobs[j][1] = jobs[j + 1][1];
							jobs[j][2] = jobs[j + 1][2];
							jobs[j + 1][0] = (int) l;
							jobs[j + 1][1] = (int) m;
							jobs[j + 1][2] = (int) n;

						}
					}
				}

			}

		}

	}