Program stopped working, when tried to run

by

You have your main problem here. 

double *tabT1;
double *tabT2;
tabT1[0]=1;
tabT1[1]=tabX[j]*(-1);
tabT2[0]=1;
tabT2[1]=tabX[i]*(-1);

You haven’t allocated the memory, instead, you have just declared the double ptrs tabT1 and tabT2 and accessing them by pretending you have allocated.

double *tabT1 = new double[2];
double *tabT2 = new double[2];

will fix this, however, I strongly suggest you to use smart pointers instead, which is much safer in your case, as it looks like you have a lot of pointer arrays.

Edit: Above fix will lead to memory leak as you are not bothering about deleting these pointer arrays, after their use, each time end of the for loop. One possible smart pointer fix could be:

std::unique_ptr<double[]> tabTT = nullptr;  // change
.....
.....

if(tabX[i] != tabX[j] && i<j)
{
   std::unique_ptr<double[]> tabT1 = std::unique_ptr<double[]>(new double[2]);  // change
   std::unique_ptr<double[]> tabT2 = std::unique_ptr<double[]>(new double[2]);  // change
   .....
   .....
   tabTT = mnozenie(std::move(tabT1), std::move(tabT2),sizeW,sizeW);
   .....
}

And in the function:

auto mnozenie(std::unique_ptr<double[]> A, std::unique_ptr<double[]> B, int m, int n)
{
   std::unique_ptr<double[]> prod = std::unique_ptr<double[]>(new double[m+n-1]);
   // calculations....    
   return std::move(prod);
}

As a side note: double tabX[wierz]; type of declaration(variable length array) has been forbidden in ISO C++ standards. The alternative is std::vector<>, which will also give you dynamically allocated a contiguous array.

More Related Contents:

  1. What is a smart pointer and when should I use one?
  2. What exactly is nullptr?
  3. Why should I use a pointer rather than the object itself?
  4. Which kind of pointer do I use when?
  5. Sorting zipped (locked) containers in C++ using boost or the STL
  6. Differences between unique_ptr and shared_ptr [duplicate]
  7. How to return a std::string.c_str()
  8. Pointers in c++ after delete
  9. Constexpr pointer value
  10. what is the difference between set and unordered_set in C++?
  11. Get pointer to object from pointer to some member
  12. What is the difference between std::reference_wrapper and a simple pointer?
  13. TMP: how to generalize a Cartesian Product of Vectors?
  14. Why would anyone use set instead of unordered_set?
  15. std::unique_ptr with derived class
  16. Why does pointer to int convert to void* but pointer to function convert to bool?
  17. Does ‘auto’ type assignments of a pointer in c++11 require ‘*’?
  18. How to implement classic sorting algorithms in modern C++?
  19. What is a dangling pointer?
  20. How to compare pointers?
  21. Specifying one type for all arguments passed to variadic function or variadic template function w/out using array, vector, structs, etc?
  22. Why doesn’t C++ use std::nested_exception to allow throwing from destructor?
  23. Is int arr[ ] valid C++?
  24. Can I use std::async without waiting for the future limitation?
  25. How to enforce the ‘override’ keyword?
  26. std::remove_const with const references
  27. Uniform initialization fails to copy when object has no data members
  28. Why aren’t there compiler-generated swap() methods in C++0x?
  29. Why must an enumeration’s size be provided when it is forward declared?
  30. What happen to pointers when vectors need more memory and realocate memory?

Leave a Comment