Advertisement
Kali_prasad

selection sort

Jun 24th, 2022
14
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.12 KB | None | 0 0
  1. #pragma GCC optimize ("O3")
  2. #pragma GCC target ("sse4")
  3.  
  4. #include <bits/stdc++.h>
  5. using namespace std;
  6.  
  7. typedef long long ll;
  8. typedef pair<int, int> pii;
  9. typedef pair<string,int> psi;
  10. typedef priority_queue<int> pqmax;
  11. typedef priority_queue<int,vector<int>,greater<int>> pqmin;
  12. typedef unordered_map<int,int> mii;
  13. typedef unordered_map<long long,long long> mll;
  14. typedef unordered_map<string,int> msi;
  15. typedef unordered_map<char,int> mci;
  16. typedef unordered_set<int> si;
  17. typedef unordered_set<long long> sll;
  18. typedef unordered_set<string> ss;
  19. typedef unordered_set<char> sc;
  20. typedef map<int,int> ormii;
  21. typedef map<long long,long long> ormll;
  22. typedef map<string,int> ormsi;
  23. typedef map<char,int> ormci;
  24. typedef set<int> orsi;
  25. typedef set<long long> orsll;
  26. typedef set<string> orss;
  27. typedef set<char> orsc;
  28. typedef vector<int> vi;
  29. typedef vector<string> vs;
  30. typedef vector<char> vc;
  31. typedef vector<ll> vll;
  32. typedef vector<vector<int>> vvi;
  33. typedef vector<vector<string>> vvs;
  34. typedef vector<vector<ll>> vvll;
  35.  
  36. #define FOR(i, a, b) for (auto i=a; i<=(b); i++)
  37. #define FORd(i,b,a) for (int i =b; i >= a; i--)
  38. #define sortinc(v) sort(v.begin(),v.end())
  39. #define sortdec(v) sort(v.rbegin(),v.rend())
  40. #define sz(x) (int)(x).size()
  41. #define mp make_pair
  42. #define pb push_back
  43. #define pob pop_back
  44. #define pf push_front
  45. #define pof pop_front
  46. #define fi first
  47. #define se second
  48. #define ins insert
  49.  
  50. const int MOD = 1000000007;
  51.  
  52. //selection sort
  53. int main() {
  54. ios_base::sync_with_stdio(false);
  55. cin.tie(NULL);
  56.  
  57. int tc=1;
  58. //cin>>tc;
  59. FOR(w,1,tc)
  60. {
  61. vi v={3,6,7,22};
  62. int n=sz(v);
  63. FOR(i,0,n-1)
  64. {
  65. int minidx=i;
  66. FOR(j,i+1,n-1)
  67. {
  68. if(v[j]<v[minidx])
  69. minidx=j;
  70. }
  71. swap(v[minidx],v[i]);
  72. int temp=i,temp2=v[i];
  73. while(temp--)
  74. {
  75. if(v[temp]>temp2)
  76. {
  77. v[temp+1]=v[temp];
  78. v[temp]=temp2;
  79. }
  80. else
  81. break;
  82.  
  83. }
  84. }
  85. FOR(i,0,n-1)
  86. cout<<v[i]<<" ";
  87. }
  88. return 0;
  89. }
  90.  
  91.  
  92.  
  93.  
  94.  
  95.  
  96.  
  97.  
  98.  
  99.  
  100.  
  101.  
  102.  
  103.  
  104.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement