2 solutions

  • 0
    @ 2025-1-23 11:33:26
    #include<bits/stdc++.h>
    using namespace std;
    int a[1145];
    int main()
    {
    	int n;
    	cin>>n;
    	for(int i=1;i<=n;i++) cin>>a[i];
    	for(int i=1;i<=n;i++){
    		for(int j=1;j+1<=n-i+1;j++){
    			if(a[j]>a[j+1]) swap(a[j],a[j+1]);
    		}
    	}
    	for(int i=1;i<=n;i++) cout<<a[i]<<" ";
    	return 0;
    }
    
    • 0
      @ 2024-10-9 20:48:06
      #include<bits/stdc++.h>
      using namespace std;
      int main(){
      	int n[25];
      	int shuru;
      	cin>>shuru;
      	for(int i=1;i<=shuru;i++)
      	{
      		cin>>n[i];
      	}
      	for(int i=2;i<=shuru;i++)
      	{ 
      		int m=i-1;
      		int t=n[i];
      		while(m>=1&&t<n[m])
      		{
      			n[m+1]=n[m];
      			m--;
      		 } 	
      		 n[m+1]=t;
      	}
      	for(int i=1;i<=shuru;i++)
      	{
      		cout<<n[i]<<" ";
      	}
      	return 0;
      }
      
      
      • 1

      Information

      ID
      113
      Time
      1000ms
      Memory
      256MiB
      Difficulty
      1
      Tags
      # Submissions
      71
      Accepted
      24
      Uploaded By