Advertisement
lancernik

AiSD 2

Apr 8th, 2019
114
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.41 KB | None | 0 0
  1. #include "header.h"
  2.  
  3. int* create(){
  4. int *myarray;
  5. myarray = (int*)malloc(SIZE* sizeof(int));
  6. return myarray;
  7. }
  8.  
  9. void init(int* myarray, int a){
  10. int i;
  11. for(i=0; i<SIZE; i++){
  12. myarray[i] = a;
  13. }
  14. }
  15.  
  16. void show(int* myarray, int n){
  17. int i;
  18. for( i=0; i<n; i++ ){
  19. printf("%d\n", myarray[i]);
  20. }
  21. }
  22.  
  23.  
  24. int* enlarge(int * myarray){
  25. int* pointer;
  26. pointer = (int*)malloc((SIZE + M )* sizeof(int));
  27. int i;
  28. for( i=0; i<(SIZE+M); i++ ){
  29. if(i<SIZE)pointer[i]=myarray[i];
  30. else pointer[i]=0;
  31. }
  32. remove1(myarray);
  33. return pointer;
  34. }
  35.  
  36. void setvalue(int* myarray, int n, int index, int value)
  37. {
  38. if(index < n){
  39. myarray[index] = value;
  40. }
  41. else{
  42. printf("Index out of size\n");
  43. }
  44. }
  45.  
  46. int readvalue(int* myarray, int n, int index){
  47. if(index < n){
  48. printf( "%d element is value of %d.\n", index, myarray[index] );
  49. return myarray[index];
  50. }
  51. else{
  52. printf("Index out of boreder\n");
  53. return -1;
  54. }
  55. }
  56. void remove1(int* myarray){
  57. printf("MemoryFreeTest\n");
  58. free(myarray);
  59. }
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66. #include <stdio.h>
  67. #include <stdlib.h>
  68. #include "header.h"
  69. #include "functions.c"
  70.  
  71. int main()
  72. {
  73.  
  74. create();
  75.  
  76.  
  77.  
  78. }
  79.  
  80.  
  81.  
  82.  
  83.  
  84.  
  85.  
  86. #ifndef HEADERR_H_INCLUDED
  87. #define HEADERR_H_INCLUDED
  88. #define SIZE
  89. #define M 2
  90.  
  91.  
  92. #endif // HEADERR_H_INCLUDED
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement