Advertisement
Guest User

asdsaddsadasdasd

a guest
Apr 29th, 2016
56
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 4.02 KB | None | 0 0
  1. #include <cstdlib>
  2. #include <cstring>
  3. #include <iostream>
  4.  
  5. using namespace std;
  6. int main() {
  7. int n,i=0,j=0;
  8. int *pn = &n;
  9. do cout << "Prirodan broj N(<=1000): ";
  10. while (cin >> *pn && *pn < 1);
  11. float (*c) = new float[n];
  12. cin.ignore();
  13. cout << "Unesi " << n << " cijelih brojeva." <<endl;
  14. for(i =0;i < n;i++)
  15. cin >> c[i];
  16. for (int i = 1; i < n; i++) {
  17. int j = i-1;
  18. float pom = c[i];
  19. while (j >= 0 && c[j] > pom) {
  20. swap(c[j+1], c[j]);
  21. j--;
  22. }
  23. swap(c[j+1],pom);
  24. }
  25. cout << endl;
  26. for(i =0;i < n;i++)
  27. cout << c[i] <<endl;
  28.  
  29. system("pause");
  30. return 0;
  31. }
  32.  
  33.  
  34. ///////////////////////////
  35.  
  36.  
  37. #include<cstdlib>
  38. #include<iostream>
  39.  
  40. using namespace std;
  41. double povrsina(double x1, double y1, double x2, double y2, double x3, double y3) {
  42. double p=1,k;
  43. k=(x1*(y2-y3)+x2*(y3-y1)+x3*(y1-y2));
  44. if(k<0) k=k*(-1);
  45. p=p*k;
  46. return p;
  47. }
  48.  
  49. int main() {
  50. int n,j;
  51. do {
  52. cout << "Prirodan broj N: ";
  53. cin>>n;
  54. } while(n<=0);
  55. double a[n][4],pom1,pom2,pom3,pom4;
  56. for(int i=0;i<n;i++) {
  57. cout << "Unesi X-koordinatu donjeg lijevog ugla " << i+1 << ". pravokutnika: ";
  58. cin >> a[i][0];
  59. cout << "Unesi Y-koordinatu donjeg lijevog ugla " << i+1 << ". pravokutnika: ";
  60. cin >> a[i][1];
  61. cout << "Unesi X-koordinatu gornjeg desnog ugla " << i+1 << ". pravokutnika: ";
  62. cin >> a[i][2];
  63. cout << "Unesi Y-koordinatu gornjeg desnog ugla " << i+1 << ". pravokutnika: ";
  64. cin >> a[i][3];
  65. }
  66. for(int i=0;i<n;i++) {
  67. j=i;
  68. 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])) {
  69. pom1=a[j-1][0];
  70. pom2=a[j-1][1];
  71. pom3=a[j-1][2];
  72. pom4=a[j-1][3];
  73. a[j-1][0]=a[j][0];
  74. a[j-1][1]=a[j][1];
  75. a[j-1][2]=a[j][2];
  76. a[j-1][3]=a[j][3];
  77. a[j][0]=pom1;
  78. a[j][1]=pom2;
  79. a[j][2]=pom3;
  80. a[j][3]=pom4;
  81. j--;
  82. }
  83. }
  84. for(int j=0;j<n;j++)
  85. cout << povrsina(a[j][0],a[j][1],a[j][2],a[j][3],a[j][0],a[j][3]) << endl;
  86.  
  87. system("pause");
  88. return 0;
  89. }
  90.  
  91.  
  92. //////////////////////////////
  93.  
  94.  
  95. #include <cstdlib>
  96. #include <ctime>
  97. #include <iostream>
  98.  
  99. using namespace std;
  100. int main() {
  101. srand(time(NULL));
  102. int p1[100000], p2[100000];
  103. for (int i = 0; i < 100000; i++)
  104. p1[i] = rand();
  105. for (int i = 0; i < 100000; i++)
  106. p2[i] = rand();
  107. clock_t zamStart = clock();
  108. for (int i = 100000 - 1; i>0; i--) {
  109. for (int j = 0; j<i; j++) {
  110. if (p1[j]>p1[i]) {
  111. float pom = p1[j];
  112. p1[j] = p1[i];
  113. p1[i] = pom;
  114. }
  115. }
  116. }
  117. clock_t zamEnd = clock();
  118. clock_t bubbleStart = clock();
  119. bool zamjena = true;
  120. for (int i = 100000 - 1; i>0 && zamjena; i--) {
  121. zamjena = false;
  122. for (int j = 0; j<i; j++) {
  123. if (p2[j]>p2[j + 1]) {
  124. float pom = p2[j];
  125. p2[j] = p2[j + 1];
  126. p2[j + 1] = pom;
  127. zamjena = true;
  128. }
  129. }
  130. }
  131. clock_t bubbleEnd = clock();
  132. double zam = double(zamEnd - zamStart) / CLOCKS_PER_SEC;
  133. double bubble = double(bubbleEnd - bubbleStart) / CLOCKS_PER_SEC;
  134. cout << (int)zam << endl << (int)bubble << endl;
  135.  
  136. system("pause");
  137. return 0;
  138. }
  139.  
  140.  
  141. /////////////////////////////////////////
  142.  
  143.  
  144. #include<cstdlib>
  145. #include<cstring>
  146. #include<ctime>
  147. #include<iostream>
  148.  
  149. using namespace std;
  150. int main() {
  151. int A[100000];
  152. int B[100000];
  153. srand(time(0));
  154. // IZBOROM
  155. for (long int i=0; i<100000; i++)
  156. A[i]=rand();
  157. clock_t izborp = clock();
  158. for (int i = 99999; i > 1; i--) {
  159. int Max = 0;
  160. for (int j = 1; j < i; j++)
  161. if (A[j] > A[Max]) Max = j;
  162. float pom = A[i-1];
  163. A[i-1] = A[Max];
  164. A[Max] = pom;
  165. }
  166. clock_t izbork = clock();
  167. double vrijeme1 = double(izbork-izborp) / CLOCKS_PER_SEC;
  168. cout << vrijeme1 << endl;
  169. // UMETANJEM
  170. for (long int i=0; i<100000; i++)
  171. B[i]=rand();
  172. clock_t umetanjep = clock();
  173. for (int i = 1; i < 100000; i++) {
  174. int j = i-1;
  175. float pom = B[i];
  176. while (j >= 0 && B[j] > pom)
  177. B[j+1] = B[j--];
  178. B[j+1] = pom;
  179. }
  180. clock_t umetanjek = clock();
  181. double vrijeme2 = double(umetanjek-umetanjep) / CLOCKS_PER_SEC;
  182. cout << vrijeme2 << endl;
  183.  
  184. system("pause");
  185. return 0;
  186. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement