linkage.c

linkage.c

contents ::

  address.c
  atquick_sort.c
  bits.c
  countspace.c
  ctof.c
  hextoint.c
  hist.c
  indexof.c
  itob.c
  linkage.c
  lzw.c
  maxval.c
  merge.c
  merge_sort.c
  peof.c
  pointer.c
  quick2.c
  quick.c
  quick_sort.c
  reverse.c
  rftoc.c
  rmultiblank.c
  rtabs.c
  squeeze.c
  structoo.c
  syscall.c
  tempfunc.c
  tfc.c
  word.c

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

main(){
  int size = 1000000;
  int * a = malloc(size * sizeof a[0]);
  int i;
  int inp;

  //for(i=0; i<20; i++){
  //  a[i]=i;
  //}

  // for(i=0; i<20; i++){
  printf("array %d:\t%p\n",0 , &a[0]);
  printf("array %d:\t%p\n",999999 , &a[999999]);
  // }
  scanf("%d", &inp);
  size = size * inp;
  a = realloc(a,size * sizeof a[0]);
  printf("\n\nrealloced array\n");

  // for(i=0; i<25; i++){
  printf("array %d:\t%p\n",0 , &a[0]);
  printf("array %d:\t%p\n",999999 , &a[999999]);
  printf("array %d:\t%p\n",1000000 , &a[1000000]);
  printf("array %d:\t%p\n",size-1 , &a[size-1]);
  // }

  free(a);

  return 0;
}

James Little