Question

DYNAMIC ALLOCATION and SORTING

INPUT:

(2) READ IN THE SIZE OF THE ARRAY THAT YOU WANT from the CONSOLE.

(2) READ IN THE CONTENTS OF THE ARRAY from a FILE

THIS PROGRAM SHOULD BE ABLE to DYNAMICALLY ALLOCATE an ARRAY the SIZE requested, and then,  SORT in ASCENDING ORDER.

Note: YOU MAY USE A SECOND ARRAY TO STORE and REORDER DATA.

OUTPUT:

(1) The ORIGINAL ARRAY

(2) The Sorted Array

Answer 1

Code :

#include<bits/stdc++.h>
using namespace std;

int main(){
int n; cin>>n; // size of the array
int *a = new int[n]; // dynamic allocation of memory
for(int i = 0; i < n ; i++) cin>>a[i]; // get the array
int *b = new int[n];
for(int i = 0 ; i < n ; i++) b[i] = a[i];
sort(b,b+n); // sort the array
cout<<"Input Array ";
for(int i = 0 ; i < n ; i++) cout<<a[i]<<" "; // print the array
cout<<endl;
cout<<"Sorted Array ";
for(int i = 0 ; i < n ; i++) cout<<b[i]<<" ";
}

Sample Run :