//sort a list(ascending)
#include <iostream>
using namespace std;
int main()
{
int i,n,j;
double temp;
cout<<"Enter the size of the list"<<endl;
cin>>n;
cout<<"Enter the elements of the list\n";
double a[n];
for (i=0;i<n;i++)
{
cin>>a[i];
}
for (i=0;i<n;i++)
{
for (j=i;j<n;j++)
{
if (a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
cout<<"\nThe sorted list is \n";
for (i=0;i<n;i++)
{
cout<<a[i]<<endl;
}
return 0;
}
Ph.D. researcher at Friedrich-Schiller University Jena, Germany. I’m a physicist specializing in computational material science. I write efficient codes for simulating light-matter interactions at atomic scales. I like to develop Physics, DFT, and Machine Learning related apps and software from time to time. Can code in most of the popular languages. I like to share my knowledge in Physics and applications using this Blog and a YouTube channel.
[wpedon id="7041" align="center"]
i followed exactly the same program as above but i couldnt get the exact result.
oh ya now i got it. it is a perfect program. my bad.
thank you 🙂 Aida Yusoff. I’m glad you found it useful.
Manas;
Have you ever worked with light spectra for content analysis; that is, to dissect reflected light so as to get a list of a sample’s constituent atomic elements? I guess that would be spectral analysis.
No, not exactly. I have done some spectroscopy but not in the way you mentioned.