Advertisement
Guest User

saf

a guest
Jan 21st, 2017
73
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.99 KB | None | 0 0
  1. void bubbleSort(int fn[], int n[], double grade[], int l)
  2. {
  3. bool flag = true;
  4. int j = 0;
  5. int temp;
  6. while (flag)
  7. {
  8. flag = false;
  9. j++;
  10. for (int i = 0; i < l - j; i++)
  11. {
  12. if (fn[i] > fn[i + 1])
  13. {
  14. temp = fn[i];
  15. fn[i] = fn[i + 1];
  16. fn[i + 1] = temp;
  17. temp = n[i];
  18. n[i] = n[i + 1];
  19. n[i + 1] = temp;
  20. double tempdbl = 0;
  21. tempdbl = grade[i];
  22. grade[i] = grade[i + 1];
  23. grade[i + 1] = tempdbl;
  24. flag = true;
  25. }
  26. }
  27. }
  28. }
  29.  
  30. void bubbleSort2(int fn[], int n[], double grade[], int l)
  31. {
  32. bool flag = true;
  33. int j = 0;
  34. int temp;
  35. while (flag)
  36. {
  37. flag = false;
  38. j++;
  39. for (int i = 0; i < l - j; i++)
  40. {
  41. if (n[i] > n[i + 1] && fn[i] == fn[i+1])
  42. {
  43. temp = fn[i];
  44. fn[i] = fn[i + 1];
  45. fn[i + 1] = temp;
  46. temp = n[i];
  47. n[i] = n[i + 1];
  48. n[i + 1] = temp;
  49. double tempdbl = 0;
  50. tempdbl = grade[i];
  51. grade[i] = grade[i + 1];
  52. grade[i + 1] = tempdbl;
  53. flag = true;
  54. }
  55. }
  56. }
  57. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement