





# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
from queue import Queue


def 					__SCREAMING_SNAKE_CASE  (							__lowercase:		Any):



  '''simple docstring'''






  __lowerCAmelCase			=				Queue()
  __lowerCAmelCase			=				[False] * len(__lowercase)
  __lowerCAmelCase			=				[-1] * len(__lowercase)

  def bfs():
    while not queue.empty():
      __lowerCAmelCase			=				queue.get()
      __lowerCAmelCase			=				True

      for neighbour in graph[u]:
        if neighbour == u:
          return False

        if color[neighbour] == -1:
          __lowerCAmelCase			=				1 - color[u]
          queue.put(__lowercase)

        elif color[neighbour] == color[u]:
          return False

    return True

  for i in range(len(__lowercase)):
    if not visited[i]:
      queue.put(__lowercase)
      __lowerCAmelCase			=				0
      if bfs() is False:
        return False

  return True


if __name__ == "__main__":
      # Adjacency List of graph
      print(check_bipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))







def 					__SCREAMING_SNAKE_CASE  (							__lowercase:		list):



  '''simple docstring'''






  if len(__lowercase) <= 1:
    return data
  else:
    return [
        *quick_sort([e for e in data[1:] if e <= data[0]]),
        data[0],
        *quick_sort([e for e in data[1:] if e > data[0]]),
    ]


if __name__ == "__main__":
      import doctest

      doctest.testmod()
