Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #ifndef Array_H
- #define Array_H
- #include <iostream>
- template <class T>
- class Array
- {
- private:
- int size;
- T *myArray;
- public:
- Array();
- Array(int);
- void setArray(int, T);
- void getArray();
- ~Array();
- void bubbleSort(int);
- };
- template <class T>
- Array<T>::Array()
- {
- size = 0;
- }
- template <class T>
- Array<T>::Array(int s)
- {
- size = s;
- myArray = new T[size];
- }
- template <class T>
- void Array<T>::setArray(int elem, T val)
- {
- myArray[elem] = val;
- }
- template <class T>
- void Array<T>::getArray()
- {
- for (int j = 0; j < size; j++)
- {
- std::cout << myArray[j] << ' ';
- }
- std::cout << '\n';
- }
- template <class T>
- Array<T>::~Array()
- {
- delete myArray;
- }
- template <class T>
- void Array<T>::bubbleSort(int n)
- {
- T temp;
- if (n == 1)
- return;
- for (int i = 0; i < n - 1; i++)
- {
- if (myArray[i] > myArray[i+1])
- {
- temp = myArray[i];
- myArray[i] = myArray[i+1];
- myArray[i+1] = temp;
- }
- }
- std::cout << "Sorting Array: ";
- for (int j = 0; j < size; j++)
- {
- std::cout << myArray[j] << ' ';
- }
- std::cout << '\n';
- bubbleSort(n - 1);
- }
- #endif
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement