algo

Just a bunch of algorithm implementations
Log | Files | Refs | README

commit 3e07fb9d0605209c1215aa2b87e2e6b0bac0dfa3
parent 51169e6a8a82ae11aa58bd1daba109b94cc88971
Author: zerous Naveen Narayanan <zerous@nocebo.space>
Date:   Fri,  1 Mar 2019 01:04:18 +0100

Remove commented code

Diffstat:
rubidium.c | 51---------------------------------------------------
1 file changed, 0 insertions(+), 51 deletions(-)

diff --git a/rubidium.c b/rubidium.c @@ -46,54 +46,3 @@ func1(int *x, int *y, int N) } return res/2; } - -/* int */ -/* func(int *x, int *y, int N) */ -/* { */ -/* int i; */ - -/* point *points = (point *) malloc(100000 * sizeof(point)); */ - -/* for (i = 0; i < N; i++) { */ -/* points[i].x = x[i]; */ -/* points[i].y = y[i]; */ -/* } */ - -/* heapperm(points, N, N); */ - -/* free(points); */ - -/* return 1; */ -/* } */ - -/* void */ -/* heapperm(point *p, int size, int N) */ -/* { */ -/* static int d; */ - -/* if (size == 1) { */ -/* for (int i = 0; i < N; i++) { */ -/* /\* printf("point x: %d point y: %d\n", p[i].x, p[i].y); *\/ */ - -/* } */ -/* } */ - -/* for (int i = 0; i < size; i++) { */ -/* heapperm(p, size - 1, N); */ - -/* if (size % 2 == 1) */ -/* swap(p, 0, size - 1); */ -/* else */ -/* swap(p, i, size - 1); */ -/* } */ -/* } */ - -/* void */ -/* swap(point *p, int a, int b) */ -/* { */ -/* point t; */ - -/* t = p[a]; */ -/* p[a] = p[b]; */ -/* p[b] = t; */ -/* } */