utilities2.c

来自「Basic test of Vigenere s Algorithm」· C语言 代码 · 共 54 行

#include "utilities2.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>


int myComparator(const void *a, const void *b)
{
        if(((subDist*)a)->frequency > ((subDist*)b)->frequency) return -1;
        else if(((subDist*)a)->frequency == ((subDist*)b)->frequency) return 0;
        else return 1;
}



int *sortArray(int* array,int sizeOfArray,int number)
{
        int i=0;
        subDist dists[sizeOfArray];
        int *output = (int*)malloc(number*sizeof(int));


        for (i=0;i<sizeOfArray;i++)
        {
            dists[i].distance = i;
            dists[i].frequency =array[i];
        }
        qsort(dists,sizeOfArray,sizeof(subDist),myComparator);
        for(i=0;i<number;i++)
            output[i]=dists[i].distance;
        return output;

}





int euklid(int a, int b)
{
    int help;
    do
    {
        help = a % b;
        a = b; b = help;
    } while( help != 0);

  return a;
}


int* primefactors(int number)
{return 0;}