here is good link i found on google Click Here

use

printf("size of char %d size of int %d",sizeof(char),sizeof(int));

bot pointer is always 4 byte no ?

maybe you can try to cast to char ?

by the way where is problem?

strcpy(*rowptr,"d");
    strcpy(*(rowptr+1),"c++");
    printf("ROWPTR+1[%s]",*(rowptr + 1));
    strcpy(*(rowptr+2),"java");
    printf("ROWPTR+2[%s]",*(rowptr + 2));

they print correct, no ?

please see howto allocate memmory for pointer to pointer Click Here took code from there

float **float_values;
//allocate memory for rows
float_values = (float**)malloc(4 *sizeof(float*));
//for each row allocate memory for columns
for(int i=0; i<4; i++)
{
   *(float_values+i) = (float*)malloc(3 *sizeof(float));
}

Indeed if you like programming then just sit and do it, there is nothing impossible, you just need time.

Actually all you need is to call function bigger 3 times in printbiggest.
If input parameters x i z j bot you will need extra parameter inside function iMax
first you get to know x and y biggest then save it and compare it to z then save it and compare it to j ?

We may help you if you post something it's small program one line in biggest with ternary expre.. and maybe 5 in print biggest

your head is not null ?

Is it necessary to free the memory of the node that is deleted?

What do you mean deleted then ? In c if you loose pointer to some data it is called memmory leak, cause no automatic garbage collection is implemented in c. In java if all references lost then free is called, you should do it manually before loosing this pointer. For example save address of some data you whant to free to tmp variable then make previous element to point to next after tmp after your linked list is ready (does not cointain this element anymore) you let go - free(tmp). Also should check if it is first and stuff..

and yes you can return this tmp pointer bot then you haveto rename this function to cutByPosition and then use this pointer to insert somewhere else.

please whole code

use this Click Here

ifeq ($(BUILD),debug)   
# "Debug" build - no optimization, and debugging symbols
CFLAGS += -O0 -g
else
# "Release" build - optimization, and no debug symbols
CFLAGS += -O2 -s -DNDEBUG
endif

all: foo

debug:
    make "BUILD=debug"

foo: foo.o
    # The rest of the makefile comes here...

How do you reverse a linked list without using any C pointers?

One way is to reverse the data in the nodes without changing the pointers themselves. One can also create a new linked list which is the reverse of the original linked list. A simple C program can do that for you. Please note that you would still use the "next" pointer fields to traverse through the linked list (So in effect, you are using the pointers, but you are not changing them when reversing the linked list).
Source

this means you have something like that ? char *array[n];
you have allocated pointers bot now you need to malloc memmory where they will point and memcpy data to that memmory, how do you copy it i dont see

How do you reverse a linked list without using any C pointers?

Reverse data structure that is linked by pointers without using pointers ? Really ? :)) No cant.

should it work same as strtok ? try not to use malloc and use array index instead of pointer arithmetic then when it works you can try pointer arithmetic(just increment address instead of index) and malloc
Make working code and convert would be more easy maybe :)

@Trentacle
so if i use stack as singly linked list i dont travel reverse when i pop it ? even link Click Here

use this wiki page that i gave you there is stack implementation algorithm, then post code and someone will help you

there is no problem to do backward or frontward in single linked, as long as it is only one way to go needed, is more needed is both or one ? or you just go from start agayn to that spot you need. Or depends how much back you whant to go if it is by one to delete then you delete element-next not element and you good to go

do you know how to create linked list ? if yes then to reverse you can use this post Click Here you just take your list and while you traverse it just move to new in reversed order

Maybe it is stack ? you push new to first and then pop from first till last ? :) that will be reverse

here is the guy who added code to help other Click Here
this is related article maybe, dont know your level and what you whant really though. Can you describe what you whant to do ? What your program must do

also this wiki it even has algorithm :)

use g++ on linux if those ide are too hard to understand with g++ you will have full control

he uses bubble sort oh no so does it work ? what will happen if he try to sort sorted ? worst case scenario yes ? need some flag atleast if nothing sorted in second cycle then no need to continue

Operator precendece
maybe this will help Click Here too

There are many ways to do this. What about the idea to use linked list and insert new names in correct place every time it is entered? Or even better would be binary tree. Or use some array of pointers to swap pointer values instead of struct values you can do it in this program too no?

@pooh1234qwerty
dont use questions like that, use printf to make shure :) make some test array to test and make it smaller maybe and if it will work in smaller it will work in bigger.
You wrote something , you should understand what you wrote, assumptions is not very good thing in programming and it's not about compiler.
To make code more readable for you and other people name variables to something meaningfull like Schol sayed i dont want to read code where something is l then something does s1 + s2 what is that and no comment
to normal human s1 doesent mean anything
hope this will help you to debug your code :) if no understand comment every line explay what it is and print results out till you have something that you cant explayn and it doesent work

alternative is malloc
you will locate it on heap instead of stack or calloc effect is same bot you haveto free it after and it can be dinamically changed during execution :)

Ancient Dragon commented: right answer :) +14

i like visual studio at work cause it's easy to navigate big project, bot at home i usually use vim, gedit maybe kate. I use notepad++ too sometimes at work, it's great.

@rubberman
arent finite state machines just regular expressions ??

Most simple solution if you know max line length and max text length would be using fgetline then compare what you got to desired if it is it read next line data. with the same thing fgetline
or fread bot then you haveto parse chunks which would be more harder or read whole file to buffer and prase if it's size is limited

See, if it confuses you so much then maybe separate calculation and printing, and print result variable only.
Also can write function to calculate

@hanananah also will work for original poster
you guys better use this one strtok

or if you know pointers good, you can locate it '|' with strchr if you have only one of these, if you have more you can ofcourse make it work too.

Or do it manually, going through array and searching position of '|' then taking whats after before | or 0

or maybe something like that to clear input buffer, if you have better solution please tell

/* getchar example : typewriter */
#include <stdio.h>

int main ()
{
  char c;
  int iNeededChars = 2;
  puts ("Enter text. Include a dot ('.') in a sentence to exit:");
  do
  {   
     c = getchar();//get needed char
     putchar (c);
     putchar('\n');
     while(c != '\n')
     {
         c = getchar();
         printf("Clearing [%c]", c);
     }
   iNeededChars--;
  }
  while(iNeededChars); 
  return 0;
}

yes qsort is good example as deceptikon told.
Bot it is not possible to pass only array or struct, you need to tell to a function howto compare those values.
For example in qsort for struct it could be a.data > b.data