if True:
    if True:
        if True:
            self.__heap.sort(
            )  # pylint: builtin sort probably faster than O(n)-time heapify

            if True:
                foo = '(                                                ' + \
                    array[0] + '                    '

if True:
    if True:
        if True:
            self.__heap.sort(
                )  # pylint: builtin sort probably faster than O(n)-time heapify

            if True:
                foo = '(                                                ' + array[0] + '                    '

Update due to logical line changes
Update due to logical line changes

  if True:
      if True:
          if True:
              self.__heap.sort(
-             )  # pylint: builtin sort probably faster than O(n)-time heapify
+                 )  # pylint: builtin sort probably faster than O(n)-time heapify
  
              if True:
-                 foo = '(                                                ' + \
+                 foo = '(                                                ' + array[0] + '                    '
-                     array[0] + '                    '
  
Update due to logical line changes
## Code Before:
if True:
    if True:
        if True:
            self.__heap.sort(
            )  # pylint: builtin sort probably faster than O(n)-time heapify

            if True:
                foo = '(                                                ' + \
                    array[0] + '                    '

## Instruction:
Update due to logical line changes
## Code After:
if True:
    if True:
        if True:
            self.__heap.sort(
                )  # pylint: builtin sort probably faster than O(n)-time heapify

            if True:
                foo = '(                                                ' + array[0] + '                    '
