So, my goal is to create a linear search, but i have got that down pat, I am having one problem with accessing strings from the struct, that i have stored using a txt file, so in `linearSearch()` I tried doing this: 

```
printf("Name: %s \n", q.name[i]);  
printf("Data: %d \n", q.data[i]);  

```

The `data` would be perfect but `name` would just print out the same name for every array which would be the last item that I put into the array.

```
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

typedef struct {
   char* name[10];
   int data[10];
}Word;

//int bubblesort (Word word);
void linearSearch(char* name, Word q);

int main (int argc, const char *argv[]){
    Word q;
    char username[9];  /* One extra for nul char. */
    int score;
    int i = 0;
    FILE *ifp, *ofp;
    ifp = fopen("Data.txt", "r");
    while (fscanf(ifp, "%s %d", &username, &score) == 2) {
        q.name[i] = username;
        printf ("Name: %s, I = %d \n", q.name[i], i);
        q.data[i] = score;
        printf ("Data: %d, I = %d \n", q.data[i], i);
        i++;
    }
    linearSearch("Matt", q);
    return EXIT_SUCCESS;
}
void linearSearch(char* name, Word q){ 
    int i = 0;
    int foundIt = 0; 
    int numNames = sizeof(&q.name);
    while ((foundIt == 0) && (i <= numNames)){
        printf("Name: %s \n", q.name[i]);
        printf("Data: %d \n", q.data[i]);
        if ((strcmp(name, q.name[i]) != 0)){
            i = i + 1;
        } else {
            foundIt = 1;
        }
    }
    if (foundIt == 1){
        printf("Name found at position %d", i); 
    } else {
        printf("Required person not found"); 
    } 
}

```