Re: Find "py.exe" & copy it to "Python" (flat, no extension).

On 6/26/2024 12:36 PM, rbowman wrote:

I have better things to do with my life
than taking on an army of 'fixers'.  DFS is bad enough.

Somewhat new C challenge!
* determine the mode of a set of random, positive ints *
My code is below.  To make the challenge easier, it generates and sorts the random numbers for you.
$ ./prog N  (to run it)
Refer to my solution whenever you want, but preferably after you've written yours.
For extra credit, determine/print the mode(s) using only one pass thru the dataset. I didn't do that - I looped it twice.
Enjoy!
====================================================================
//this program determines the mode of a set of integers
//this code is hereby donated to the public domain
#include <stdlib.h>
#include <stdio.h>
#include <time.h>
//comparator function used with qsort
int compareint (const void * a, const void * b)
{
   if (*(int*)a > *(int*)b) return 1;
   else if (*(int*)a < *(int*)b) return -1;
   else return 0;
}
int main(int argc, char *argv[])
{
//vars
int N = atoi(argv[1]);
int *nums  = malloc(N * sizeof(int));
int i = 0;

//------------------------------------------------------------------
//generate random numbers
//------------------------------------------------------------------
int low = 1, high = N*3;
srand(time(NULL));
for(i=0;i<N;i++) {
nums[i] = (low + rand() / (RAND_MAX / (high - low + 1) + 1));
}

printf("%d randoms between 1 and %d\n", N, 3*N);
for(i=0;i<N;i++) { printf("%d ", nums[i]); }
qsort(nums,N,sizeof(int),compareint);
printf("\nSorted\n");
for(i=0;i<N;i++) { printf("%d ", nums[i]); }

//------------------------------------------------------------------
//determine mode
//------------------------------------------------------------------
int maxoccur = 0, dmax = nums[N-1];
int *modecnt = calloc(dmax + 1, sizeof(int));

//get count of each value in dataset
for(i = 0; i < N; i++)   {
modecnt[nums[i]]++;
if(modecnt[nums[i]] > maxoccur) {
maxoccur = modecnt[nums[i]];
}
}

//print each value that occurs the most often
if (maxoccur > 1) {
printf("\n\nmode: ");
for(i = 0; i <= dmax; i++) {
if(modecnt[i] == maxoccur) {
printf("%d ",i);
}
}
printf("(%d occurrences ea.)", maxoccur);
}

//no repeating values
if (maxoccur == 1) {
printf("\nmode: na (no repeating values)");
}

free(modecnt);
free(nums);

printf("\n");
return 0;
}
====================================================================