INNER CODE UNIT · C

q

lh3/yak · 6gjdn.c:28

					q = i * n + js[k];
					t = a[p];
					a[p] = a[q];
					a[q] = t;
				}
			if (is != k) {
				for (j = k; j <= n - 1; j++) {
					p = k * n + j;
					q = is * n + j;
					t = a[p];
					a[p] = a[q];
					a[q] = t;
				}
				for (j = 0; j <= m - 1; j++) {
					p = k * m + j;
					q = is * m + j;
					t = b[p];
					b[p] = b[q];

View source record →

📰 Research Paper
Loading…
⏳ Fetching content…