oniic/sibsutis
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

bruh

Browse Source
This commit is contained in:
oniic
2026-04-25 17:23:04 +07:00
parent 7f0f6ab5ba
commit 92b040fb32
129 changed files with 1809 additions and 1112 deletions
Download Patch File Download Diff File Expand all files Collapse all files
1Y-2H/dsa/lab2/code/main.c
+20 -18
View File
@@ -2,7 +2,7 @@
#include <time.h>
double get_time();
void fill_rand(uint32_t *arr, int n);
void fill_rand(uint32_t *arr, uint32_t n);
int main(int argc,char **argv) {
srand(get_time());
@@ -14,42 +14,42 @@ int main(int argc,char **argv) {
break;
case '2': // Test Sorts
{
int n;
uint32_t n;
if(!(argv[1][1]>='a'&&argv[1][1]<='z')){
printf("\nPrint 2(r/h/b/m) to sort or 3 to see var");
printf("\n2r - radix\n2h - heap\n2b - bubble\n2m - merge\n");
return 0;}
printf("Write n:");
scanf("%d",&n);
scanf("%" SCNu32, &n);
while(getchar()>'\n');
uint32_t *arr = (uint32_t*)malloc(sizeof(uint32_t) * n);
printf("Write n nums:");
for (int i = 0;i<n;i++){
scanf("%d",&arr[i]);
for (uint32_t i = 0;i<n;i++){
scanf("%" SCNu32, &arr[i]);
}
for(int i = 0; i<n;i++)printf("%d ",arr[i]);
for(uint32_t i = 0; i<n;i++)printf("%p %d\n",&arr[i],arr[i]);
putchar('\n');
switch(argv[1][1]){
case 'r': // Radix
sort_radix(arr,n);
for(int i = 0; i<n;i++)printf("%d ",arr[i]);
for(uint32_t i = 0; i<n;i++)printf("%p %d\n",&arr[i],arr[i]);
break;
case 'h': // Heap
sort_heap(arr,n);
for(int i = 0; i<n;i++)printf("%d ",arr[i]);
for(uint32_t i = 0; i<n;i++)printf("%p %d\n",&arr[i],arr[i]);
break;
case 'b': //Bubble
sort_bubble(arr,n);
for(int i = 0; i<n;i++)printf("%d ",arr[i]);
for(uint32_t i = 0; i<n;i++)printf("%p %d\n",&arr[i],arr[i]);
break;
case 'm': //Merge
sort_merge(arr,0,n-1);
for(int i = 0; i<n;i++)printf("%d ",arr[i]);
for(uint32_t i = 0; i<n;i++)printf("%p %d\n",&arr[i],arr[i]);
break;
default:
printf("\nPrint 2(r/h/b/m) to sort or 3 to see var");
printf("\nPruint32_t 2(r/h/b/m) to sort or 3 to see var");
printf("\n2r - radix\n2h - heap\n2b - bubble\n2m - merge\n");
return 0;
}
@@ -63,7 +63,7 @@ int main(int argc,char **argv) {
}
default:
{
printf("\nPrint 2(r/h/b/m) to sort or 3 to see var");
printf("\nPruint32_t 2(r/h/b/m) to sort or 3 to see var");
printf("\n2r - radix\n2h - heap\n2b - bubble\n2m - merge\n");
return 0;
}
@@ -82,7 +82,7 @@ void run_exp(void) {
fprintf(f, "# N Radix Heap Bubble \n");
int n = MILLION,end=MILLION,step = 50000;
uint32_t n = MILLION,end=MILLION,step = 50000;
for (;n<=end;n+=step){
uint32_t *arrA = (uint32_t*)malloc(sizeof(uint32_t) * n);
@@ -92,9 +92,11 @@ void run_exp(void) {
double tRadTotal = 0;
double tHeapTotal = 0;
double tBubblTotal = 0;
for (int i = 0; i < AVG_TIME_LOOPS; i++) {
for (uint32_t i = 0; i < AVG_TIME_LOOPS; i++) {
fill_rand(arrA, n);
arrC = arrB = arrA;
memcpy(arrB, arrA, n * sizeof(uint32_t));
memcpy(arrC, arrA, n * sizeof(uint32_t));
double ta = get_time();
sort_radix(arrA,n);
@@ -126,11 +128,11 @@ void run_exp(void) {
return;
}
int get_rand(int min, int max) {
uint32_t get_rand(uint32_t min, uint32_t max) {
return (double)rand() / (RAND_MAX + 1.0) * (max - min) + min;
}
void fill_rand(uint32_t *arr, int n) {
for (int i = 0; i < n; i++) arr[i] = get_rand(0, AVG_RAND_MAX);
void fill_rand(uint32_t *arr, uint32_t n) {
for (uint32_t i = 0; i < n; i++) arr[i] = get_rand(0, AVG_RAND_MAX);
}
double get_time() {