






def        _lowerCamelCase		(  __A      :							Union[str, Any]	) ->   int:
    _UpperCAmelCase			: Any     					=			len(__A	)
    for _ in range(
        0						,						int(((no_of_elements - 1) / 2) + 1	)	):  # we don't need to traverse to end of list as
        for j in range(0						,						no_of_elements - 1	):
            if (
                lst[j + 1] < lst[j]
            ):  # applying bubble sort algorithm from left to right (or forwards)
                _UpperCAmelCase			: Optional[Any]     					=			lst[j + 1]
                _UpperCAmelCase			: Optional[int]     					=			lst[j]
                _UpperCAmelCase			: List[str]     					=			temp
            if (
                lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
            ):  # applying bubble sort algorithm from right to left (or backwards)
                _UpperCAmelCase			: Optional[int]     					=			lst[no_of_elements - 1 - j]
                _UpperCAmelCase			: List[Any]     					=			lst[no_of_elements - 2 - j]
                _UpperCAmelCase			: str     					=			temp
    return lst


if __name__ == "__main__":
  print('enter the list to be sorted')
  SCREAMING_SNAKE_CASE								=  [int(x) for x in input().split()]  # inputing elements of the list in one line
  SCREAMING_SNAKE_CASE								=  double_sort(lst)
  print('the sorted list is')
  print(sorted_lst)












from unittest.mock import patch

import datasets
from datasets import Dataset

def        _lowerCamelCase		(  ) ->   Tuple:
    _UpperCAmelCase			: Union[str, Any]     					=			Dataset.from_dict({'''col_1''': [3, 2, 0, 1]}	)

    with patch('''tqdm.auto.tqdm'''	) as mock_tqdm:
        datasets.disable_progress_bar()
        dset.map(lambda __A	: {"col_2": x["col_1"] + 1}	)
        mock_tqdm.assert_not_called()

        mock_tqdm.reset_mock()

        datasets.enable_progress_bar()
        dset.map(lambda __A	: {"col_2": x["col_1"] + 1}	)
        mock_tqdm.assert_called()




