Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdlib>
- using namespace std;
- template <class T>
- void bubbleSort(T arr[], int size){
- bool flag = true;
- for(int i = 0; (i < size-1) && flag; i++){
- flag = false;
- for(int j = 0; j < size-i-1; j++){
- if(arr[j] > arr[j + 1]){
- T temp = arr[j];
- arr[j] = arr[j + 1];
- arr[j + 1] = temp;
- flag = true;
- }
- }
- }
- }
- template <class T>
- void display(T arr[], int size){
- for(int i = 0; i < size; i++){
- cout << arr[i] << ", ";
- }
- cout << endl;
- }
- template <class T>
- void input(T arr[], int size){
- for(int i = 0; i < size; i++){
- cout << "arr[" << i << "] = ";
- cin >> arr[i];
- }
- }
- int main() {
- system("cls");
- int arr1[] = {38, 41, 56, 32, 14, 22};
- double arr2[] = {1.2, 7.4, 3.3, 7.4, 6.93};
- int size1 = sizeof(arr1) / sizeof(arr1[0]);
- int size2 = sizeof(arr2) / sizeof(arr2[0]);
- cout << "Before sorting\n";
- display(arr1, size1);
- bubbleSort(arr1, size1);
- cout << "After sorting\n";
- display(arr1, size1);
- cout << endl;
- cout << "Before sorting\n";
- display(arr2, size2);
- bubbleSort(arr2, size2);
- cout << "After sorting\n";
- display(arr2, size2);
- return 0;
- }
Add Comment
Please, Sign In to add comment