Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int main()
- {
- char c;
- cout << "Introdu metoda de sortare:";
- cin >> c;
- int n;
- cout << "Introdu nr de elemente:"; cin >> n;
- int v[100];
- for (int i = 0; i < n; i++)
- cin >> v[i];
- switch (c)
- {
- case'b'://buble sort
- {
- int i = 0;
- int ok = 0;
- do
- {
- ok = 0;
- for (int j = 0; j < n - i - 1; j++)
- {
- if (v[j] >= v[j + 1])
- {
- swap(v[j], v[j + 1]);
- ok = 1;
- }
- }
- ++i;
- } while (ok);
- break;
- }
- case'i'://insertion sort
- {
- for (int i = 0; i < n; i++)
- {
- int x = v[i];
- int j = i - 1;
- while (j >= 0 && v[j] > x)
- {
- v[j + 1] = v[j];
- j--;
- }
- v[j + 1] = x;
- }
- break;
- }
- case 's'://selection sort
- {
- for (int i = 0; i < n - 1; i++)
- {
- for (int j = i + 1; j < n; j++)
- {
- if (v[j] <= v[i])
- {
- swap (v[i], v[j]);
- }
- }
- }
- break;
- }
- case'n':
- {
- int b[100], c[100];
- for (int i = 0; i < n; i++)
- {
- b[i] = 0;
- }
- for (int i = 0; i < n-1; i++)
- {
- int cnt = 0;
- for (int j = i + 1; j < n; j++)
- {
- if (v[i] > v[j])
- b[i]++;
- else
- b[j]++;
- }
- }
- for (int i = 0; i < n; ++i)
- {
- c[b[i]] = v[i];
- }
- for (int i = 0; i < n; ++i)
- cout << c[i]<<" ";
- cout << endl;
- break;
- }
- }
- for (int i = 0; i < n; i++)
- cout << v[i] << " ";
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement