nav[aria-label="Primary Navigation"] { padding: 0; & ul { list-style: none; width: 100%; display: flex; flex-direction: row; justify-content: start; align-items: start; gap: 30px; padding: 0; & li { margin: 0; } & ul li { list-style: none; } } }

Child Item

Help with C Programming badly needed

adocholiday

Hi all,

I'm doing a programming course at the minute and am working on 2 programs. I really really need some help as I'm so stuck.

If anyone could help me out I would really appreciate it.

Find more posts tagged with

Quick Links

Comments

dlofnep

It would help if you posted what the objectives are, what code you have written so far in attempt to achieve it, and where exactly you are stuck. Don't expect anyone to write a program from scratch for you.

adocholiday

I'm writing a spellchecker at the minute. I have a dictionary file and a user text file. I have to compare the user file with the dictionary file and compare the 2. I'm thinking load the 2 files into memory and do a binary search. I have a function for loading the files, code below for one, but I'm completely lost with how to do a binary search. Is there an easier alternative?

void readfile(char *dictionary) //Reads the dictionary file into memory for optimized searching//
{
FILE *fp1 = fopen("dictionary.txt","rb");

fseek(fp1,0,SEEK_END);
float endpos = ftell(fp1);

fseek(fp1,0,SEEK_SET);

char *dictionary = malloc(endpos);
fread(dictionary, endpos, 1, fp1);

fclose(fp1);
}

FSL

Get a piece of paper. Draw the logic for a binary search. Check it flows correctly with no dead ends. Then convert it into instructions which your computer can recognise.

Irrespective of whatever language you are using the logic of a binary search remains the same.

Working out the logic is programming, putting it into a form a computer
recognises is coding.