#include<stdio.h>
#include<stdlib.h>
#include"list.h"
int i;
node *p;
node *n;

void insert(node *pointer, int data){
//go through list till ya find the last node
while(pointer->next!=NULL){
pointer = pointer->next;
}
//allocate memory for new node and put data in it
pointer->next = (node *)malloc(sizeof(node));
(pointer->next)->prev= pointer;
pointer = pointer->next;
pointer->data=data;
pointer->next = NULL;
}
void print(node *pointer){
if(pointer==NULL){
return;}
printf("%d ",pointer->data);
print(pointer->next);
}

int init(node *pointer,int find){
pointer =pointer->next;
while(pointer!=NULL){
if(pointer->data== find)//found find
{
printf("The data is in the list.");
return 1;
}
pointer = pointer->next;// Search in the next node.
}
//find is not found
printf("The data is not in the list.");
return 0;
}
void swap (node *x, node *y){
    int temp= x->data;
    x->data=y->data;
    y->data=temp;
}
void sort(node*pointer){
	int i;
	while(pointer->next!=NULL){
if(pointer->data>pointer->next->data){
    swap(pointer,pointer->next);
    }
    pointer=pointer->next;
    sort(pointer);
    }
}








int main(){
//new is used to point to the first node
//temp is for the last node
node *new, *temp;
int z;
new=(node *)malloc(sizeof(node));
temp= new;
temp ->next = NULL;
temp ->prev = NULL;

for(z=0;z<10;z++){
insert(new,(3*10)-z);
}
init(new,12);
init(new,3);
init(new,27);
init(new,7);
print(new);
sort(new);
print(new);

}

macosxnerd101, on 10 February 2013 - 03:05 AM, said:

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

int main(int argc, char *argv[])
{
size_t len;
char line[120];
int i=1;
if(argc!=2 ) // argc should be three
{
printf("Usage: %s filename", argv[0]);
}
else{
FILE *file =fopen(argv[1],"r");
if (file==0){
printf("Could not open file\n");
}
while(fgets(line,sizeof(line),file)){
if (strstr(line,"brown"))
{
printf("%d \n",i);
i++;
}
else
{
i++;
}
}
}
return 0;
}
    

while(fgets(line,sizeof(line),file)){
for(i=0;i<sizeof(line);i++){
if(strstr(line,"brown"))
{
printf("%d",i);
}