Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <cstdlib>
- #include <cstring>
- #include <iostream>
- using namespace std;
- int main() {
- int n,i=0,j=0;
- int *pn = &n;
- do cout << "Prirodan broj N(<=1000): ";
- while (cin >> *pn && *pn < 1);
- float (*c) = new float[n];
- cin.ignore();
- cout << "Unesi " << n << " cijelih brojeva." <<endl;
- for(i =0;i < n;i++)
- cin >> c[i];
- for (int i = 1; i < n; i++) {
- int j = i-1;
- float pom = c[i];
- while (j >= 0 && c[j] > pom) {
- swap(c[j+1], c[j]);
- j--;
- }
- swap(c[j+1],pom);
- }
- cout << endl;
- for(i =0;i < n;i++)
- cout << c[i] <<endl;
- system("pause");
- return 0;
- }
- ///////////////////////////
- #include<cstdlib>
- #include<iostream>
- using namespace std;
- double povrsina(double x1, double y1, double x2, double y2, double x3, double y3) {
- double p=1,k;
- k=(x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2));
- if(k<0) k=k*(-1);
- p=p*k;
- return p;
- }
- int main() {
- int n,j;
- do {
- cout << "Prirodan broj N: ";
- cin>>n;
- } while(n<=0);
- double a[n][4],pom1,pom2,pom3,pom4;
- for(int i=0;i<n;i++) {
- cout << "Unesi X-koordinatu donjeg lijevog ugla " << i+1 << ". pravokutnika: ";
- cin >> a[i][0];
- cout << "Unesi Y-koordinatu donjeg lijevog ugla " << i+1 << ". pravokutnika: ";
- cin >> a[i][1];
- cout << "Unesi X-koordinatu gornjeg desnog ugla " << i+1 << ". pravokutnika: ";
- cin >> a[i][2];
- cout << "Unesi Y-koordinatu gornjeg desnog ugla " << i+1 << ". pravokutnika: ";
- cin >> a[i][3];
- }
- for(int i=0;i<n;i++) {
- j=i;
- while(j>0 && povrsina(a[j-1][0],a[j-1][1],a[j-1][2],a[j-1][3],a[j-1][0],a[j-1][3])<povrsina(a[j][0],a[j][1],a[j][2],a[j][3],a[j][0],a[j][3])) {
- pom1=a[j-1][0];
- pom2=a[j-1][1];
- pom3=a[j-1][2];
- pom4=a[j-1][3];
- a[j-1][0]=a[j][0];
- a[j-1][1]=a[j][1];
- a[j-1][2]=a[j][2];
- a[j-1][3]=a[j][3];
- a[j][0]=pom1;
- a[j][1]=pom2;
- a[j][2]=pom3;
- a[j][3]=pom4;
- j--;
- }
- }
- for(int j=0;j<n;j++)
- cout << povrsina(a[j][0],a[j][1],a[j][2],a[j][3],a[j][0],a[j][3]) << endl;
- system("pause");
- return 0;
- }
- //////////////////////////////
- #include <cstdlib>
- #include <ctime>
- #include <iostream>
- using namespace std;
- int main() {
- srand(time(NULL));
- int p1[100000], p2[100000];
- for (int i = 0; i < 100000; i++)
- p1[i] = rand();
- for (int i = 0; i < 100000; i++)
- p2[i] = rand();
- clock_t zamStart = clock();
- for (int i = 100000 - 1; i>0; i--) {
- for (int j = 0; j<i; j++) {
- if (p1[j]>p1[i]) {
- float pom = p1[j];
- p1[j] = p1[i];
- p1[i] = pom;
- }
- }
- }
- clock_t zamEnd = clock();
- clock_t bubbleStart = clock();
- bool zamjena = true;
- for (int i = 100000 - 1; i>0 && zamjena; i--) {
- zamjena = false;
- for (int j = 0; j<i; j++) {
- if (p2[j]>p2[j + 1]) {
- float pom = p2[j];
- p2[j] = p2[j + 1];
- p2[j + 1] = pom;
- zamjena = true;
- }
- }
- }
- clock_t bubbleEnd = clock();
- double zam = double(zamEnd - zamStart) / CLOCKS_PER_SEC;
- double bubble = double(bubbleEnd - bubbleStart) / CLOCKS_PER_SEC;
- cout << (int)zam << endl << (int)bubble << endl;
- system("pause");
- return 0;
- }
- /////////////////////////////////////////
- #include<cstdlib>
- #include<cstring>
- #include<ctime>
- #include<iostream>
- using namespace std;
- int main() {
- int A[100000];
- int B[100000];
- srand(time(0));
- // IZBOROM
- for (long int i=0; i<100000; i++)
- A[i]=rand();
- clock_t izborp = clock();
- for (int i = 99999; i > 1; i--) {
- int Max = 0;
- for (int j = 1; j < i; j++)
- if (A[j] > A[Max]) Max = j;
- float pom = A[i-1];
- A[i-1] = A[Max];
- A[Max] = pom;
- }
- clock_t izbork = clock();
- double vrijeme1 = double(izbork-izborp) / CLOCKS_PER_SEC;
- cout << vrijeme1 << endl;
- // UMETANJEM
- for (long int i=0; i<100000; i++)
- B[i]=rand();
- clock_t umetanjep = clock();
- for (int i = 1; i < 100000; i++) {
- int j = i-1;
- float pom = B[i];
- while (j >= 0 && B[j] > pom)
- B[j+1] = B[j--];
- B[j+1] = pom;
- }
- clock_t umetanjek = clock();
- double vrijeme2 = double(umetanjek-umetanjep) / CLOCKS_PER_SEC;
- cout << vrijeme2 << endl;
- system("pause");
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement