Advertisement
Guest User

Untitled

a guest
Nov 20th, 2019
119
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 1.95 KB | None | 0 0
  1. #include "pch.h"
  2. #include <iostream>
  3.  
  4. using namespace std;
  5.  
  6. void fill_Array(int *const arr, const int size)
  7. {
  8.     for (int i = 0; i < size; i++)
  9.     {
  10.         arr[i] = rand() % 50;
  11.         cout << arr[i] << " ";
  12.     }
  13.     cout << endl;
  14. }
  15. void push_back(int *&arr, int &size, const int value)
  16. {
  17.     int *new_Arr = new int[size+1];
  18.    
  19.     for (int i = 0; i < size; i++)
  20.     {
  21.         new_Arr[i] = arr[i];
  22.     }
  23.    
  24.     new_Arr[size++] = value;
  25.    
  26.     delete[] arr;
  27.     arr = new_Arr;
  28. }
  29.  
  30. void pop_back(int *&arr, int &size)
  31. {
  32.     int* new_Arr = new int[size - 1];
  33.    
  34.     for (int i = 0; i < size-1; i++)
  35.     {
  36.         new_Arr[i] = arr[i];
  37.     }
  38.    
  39.     delete[] arr;
  40.     arr = new_Arr;
  41.     size--;
  42. }
  43. void show_Array(int *const arr,  const int size)
  44. {
  45.     for (int i = 0; i < size; i++)
  46.     {
  47.         cout << arr[i] << " ";
  48.     }
  49.     cout << endl;
  50. }
  51. void push_front(int *&arr, int &size, const int value)
  52. {
  53.     int* new_Arr = new int[size+1];
  54.         for (int i = 0; i < size+1; i++)
  55.         {
  56.             new_Arr[i+1] = arr[i];
  57.         }
  58.  
  59.         new_Arr[0] = value;
  60.         size++;
  61.         delete[] arr;
  62.         arr = new_Arr;
  63. }
  64. void pop_front(int *&arr, int &size)
  65. {
  66.     int* new_Arr = new int[size - 1];
  67.         for (int i = 0; i < size; i++)
  68.         {
  69.             new_Arr[i] = arr[i + 1];
  70.         }
  71.  
  72.         delete[] arr;
  73.         size--;
  74.         arr = new_Arr;
  75. }
  76. void insert(int *&arr, int &size, const int value, const int index)
  77. {
  78.     int* new_Arr = new int[size+1];
  79.     int j = 0;
  80.        
  81.     if (index > size+1)
  82.         cout << "error";
  83.    
  84.     for (int i = 0; i < size+1; i++)
  85.     {  
  86.         new_Arr[i] = arr[j];
  87.        
  88.         if (i == index)
  89.         {
  90.             i++;
  91.             new_Arr[i] = value;            
  92.         }
  93.        
  94.         j++;
  95.        
  96.     }
  97.     size++;
  98.     delete[] arr;
  99.     arr = new_Arr;
  100.  
  101. }
  102. int main()
  103. {
  104.     int size, value, index;
  105.     cout << "input size, value ";
  106.     cin >> size >> value;
  107.     int *arr = new int[size];
  108.     int *arr_1 = new int[size];
  109.     cout << "insert value after index, cin index ";
  110.     cin >> index;
  111.  
  112.     fill_Array(arr_1, size);       
  113.     show_Array(arr_1, size);
  114.     insert(arr_1, size, value, index);
  115.     show_Array(arr_1, size);
  116.  
  117.  
  118.  
  119.     delete[] arr_1;
  120.     delete[] arr;
  121.  
  122.    
  123. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement