Arkanjo 0.1
A tool for find code duplicated functions in codebases
Loading...
Searching...
No Matches
big.c
Go to the documentation of this file.
1#include <stdio.h>
2#include <stdlib.h>
3
4//big function
5
7
8 int *v_sorted = (int*)malloc(n*sizeof(int));
9 int *dist_to_median = (int*)malloc(n*sizeof(int));
10 int *p = (int*)malloc(n*sizeof(int));
11 int median;
12
13 for(int i = 0; i < n; i++){
14 v_sorted[i] = i;
15 }
16
17 for(int i = 0; i < n; i++){
18 for(int j = 0; j < n-1; j++){
19 if(v[v_sorted[j]] > v[v_sorted[j+1]]){
20 int aux = v_sorted[j];
21 v_sorted[j] = v_sorted[j+1];
22 v_sorted[j+1] = aux;
23 }
24 }
25 }
26
27 median = v[v_sorted[n/2]];
28
29 for(int i = 0; i < n; i++){
30 dist_to_median[i] = v[i]-median;
31 if(dist_to_median[i] < 0){
32 dist_to_median[i] *= -1;
33 }
34 }
35
36 for(int i = 0; i < n; i++){
37 p[i] = i;
38 }
39
40 for(int i = 0; i < n; i++){
41 for(int j = 0; j < n-1; j++){
42 if(dist_to_median[p[j]] > dist_to_median[p[j+1]]){
43 int aux = p[j];
44 p[j] = p[j+1];
45 p[j+1] = aux;
46 }
47 }
48 }
49
52 return p;
53}
54
55int main(int argc, char *argv[]){
56
57 int v[6];
58 v[0] = 5;
59 v[1] = 3;
60 v[2] = 4;
61 v[3] = 1;
62 v[4] = 2;
63 v[5] = 1;
64 int n = 6;
65
67
68 for(int i = 0; i < n; i++){
69 printf("%d ",p[i]);
70 }
71 printf("\n");
72
73 free(p);
74 return 0;
75}
int main(int argc, char *argv[])
Definition big.c:55
int * sorted_by_distance_to_median(int v[], int n)
Definition big.c:6
free(p)
printf("\n")
int n
Definition main.c:10
v[0]
Definition main.c:4
int * p
Definition main.c:12
int * dist_to_median
return v_sorted