4 solutions

  • 2
    @ 2025-1-23 11:33:21
    #include<bits/stdc++.h>
    using namespace std;
    const int N=25;
    int a[N];
    int main()
    {
    		int n;
    		cin>>n;
    		for(int i=1;i<=n;i++)
    		{
    			cin>>a[i];
    		}
    		for(int i=1;i<=n;i++)
    		{
    			int t=i;
    			for(int j=i+1;j<=n;j++)
    			{
    				if(a[j]<a[t])
    				{
    					t=j;
    				}
    			}
    			swap(a[t],a[i]);
    		}
    		for(int i=1;i<=n;i++)
    		{
    			cout<<a[i]<<" ";
    		}
    	return 0;
    }
    
    • 0
      @ 2026-7-27 10:22:29
      #include<bits/stdc++.h>
      using namespace std;
      const int N=25;
      int a[N];
      int main()
      {
      	int n;
      	cin>>n;
      	for(int i=1;i<=n;i++)
      	{
      		cin>>a[i];
      	}
      	for(int i=1;i<=n;i++)
      	{
      		int t=i;
      		for(int j=i+1;j<=n;j++)
      		{
      			if(a[j]<a[t])
      			{
      				t=j;
      			}
      		}
      		swap(a[t],a[i]);
      	}
      	for(int i=1;i<=n;i++)
      	{
      		cout<<a[i]<<" ";
      	}
      	return 0;
      }
      • 0
        @ 2025-1-15 9:21:43

        #include<bits/stdc++.h> using namespace std; const int N=100; int a[N]; int main() { int n; cin>>n; for(int i=1;i<=n;i++) { cin>>a[i]; } for(int k=1;k<=n;k++) { int t=k; for(int j=k+1;j<=n;j++) { if(a[j]<a[t]) { t=j; } } swap(a[t],a[k]); } for(int m=1;m<=n;m++) { cout<<a[m]<<" "; } return 0; }

        • -1
          @ 2025-3-7 19:47:22

          #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; }

          • 1

          Information

          ID
          114
          Time
          1000ms
          Memory
          256MiB
          Difficulty
          1
          Tags
          (None)
          # Submissions
          76
          Accepted
          39
          Uploaded By