Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cmath>
- #include <iostream>
- #include <vector>
- long long sort_test(const int n) {
- std::vector<int> A(n);
- for (int ii = 0; ii < n; ++ii) {
- A[ii] = n-ii;
- }
- long long operations_performed = 0; // We do not count initialization.
- for (int ii = 1; ii < n; ++ii) {
- operations_performed += 5; // Loop operations and inequality evaluation.
- if (A[ii-1] > A[ii]) {
- operations_performed += 4; // Swap and restart.
- const int tmp = A[ii-1];
- A[ii-1] = A[ii];
- A[ii] = tmp;
- ii = 0;
- }
- }
- return operations_performed;
- }
- int main() {
- for (int ii = 20; ii < 1000; ++ii) {
- long long operations_performed = sort_test(ii);
- std::cout << ii << ' ' << operations_performed << ' '
- << log(ii) << ' ' << log(operations_performed) << '\n';
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement