Advertisement
Guest User

Untitled

a guest
Feb 19th, 2020
95
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 2.19 KB | None | 0 0
  1. #include <iostream>
  2. #include <string>
  3. #include <cassert>
  4. using namespace std;
  5.  
  6. int divide(string array[], int n, string divider);
  7. int divide(string array[], int n, string divider)
  8. {
  9. int numberofequal = 0;
  10. int numberoflower = 0;
  11. int numberofhigher = 0;
  12. string storedvalue;
  13. int position = 0;
  14. int none = 0;
  15.  
  16. if (n <= 0)
  17. {
  18. position = 0;
  19. }
  20. else
  21. {
  22. for (int i = 0; i < n; i++)
  23. {
  24. if (divider > array[i])
  25. {
  26. numberoflower = numberoflower + 1;
  27. }
  28. if (divider == array[i])
  29. {
  30. numberofequal = numberofequal + 1;
  31. }
  32. if (divider < array[i])
  33. {
  34. numberofequal = numberofequal + 1;
  35. }
  36. }
  37. if (numberoflower == 0)
  38. {
  39. none = 0;
  40. }
  41. for (int i = 0; i < n; i++)
  42. {
  43. if (divider <= array[i] && numberoflower > 0)
  44. {
  45. string storedvalue = array[i];
  46. for (int c = i; c < n; c++)
  47. {
  48. array[c] = array[c + 1];
  49. }
  50. array[n - 1] = storedvalue;
  51. i = i - 1;
  52. }
  53. else if (divider > array[i] && numberoflower > 0)
  54. {
  55. numberoflower = numberoflower - 1;
  56. }
  57. position = i + 1;
  58. }
  59. for (int i = position; i < n; i++)
  60. {
  61. if (divider < array[i] && numberofequal > 0)
  62. {
  63. string storedvalue = array[i];
  64. for (int c = i; c < n; c++)
  65. {
  66. array[c] = array[c + 1];
  67. }
  68. array[n - 1] = storedvalue;
  69. i = i - 1;
  70. }
  71. else if (divider == array[i] && numberofequal > 0)
  72. {
  73. numberofequal = numberofequal - 1;
  74. }
  75. }
  76. }
  77. if (none == 0)
  78. {
  79. position = 0;
  80. }
  81. return(position);
  82. }
  83.  
  84.  
  85. int main()
  86. {
  87. string b[5] = { "f", "a", "e", "g", "d" };
  88. cout << divide(b, 5, "e");
  89.  
  90.  
  91.  
  92. return 0;
  93. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement