Merge pull request ashutosh97#20 from Casey-McCray/master

Arrangement of Queue

Author: ashutosh97

Arrangement_of_Queue/Question.txt

@@ -0,0 +1,4 @@
+Find the arrangement of queue at given time:
+
+n people are standing in a queue to buy entry ticket for the carnival. People present there strongly believe in chivalry. Therefore, at time = t, if a man at position x, finds a woman standing behind him then he exchanges his position with her and therefore, at time = t+1, woman is standing at position x while man is standing behind her.
+Given the total number of people standing in a queue as n, particular instant of time as t and the initial arrangement of the queue in the form of a string containing �M� representing man at position i and �W� representing woman is at position i, find out the arrangement of the queue at time = t.

Arrangement_of_Queue/README.md

@@ -0,0 +1,2 @@
+### One of the easy Competitve Programming Problems
+but still a great add

Arrangement_of_Queue/Solution.py

@@ -0,0 +1,24 @@
+
+def solve(n, t, p) : 
+    
+    s = list(p) 
+ 
+    for i in range(0, t) : 
+      
+        for j in range(0, n - 1) :      
+
+            if (s[j] == 'B' and
+                s[j + 1] == 'G') : 
+                  
+                temp = s[j]; 
+                s[j] = s[j + 1]; 
+                s[j + 1] = temp; 
+                j = j + 1    
+                  
+    print (''.join(s)) 
+  
+
+n = 6
+t = 2
+p = "BBGBBG"
+solve(n, t, p)