

"""simple docstring"""






from typing import TYPE_CHECKING

from ....utils import OptionalDependencyNotAvailable, _LazyModule, is_tokenizers_available, is_torch_available


lowerCamelCase__			:					int							  =					{
    '''configuration_retribert''': ['''RETRIBERT_PRETRAINED_CONFIG_ARCHIVE_MAP''', '''RetriBertConfig'''],
    '''tokenization_retribert''': ['''RetriBertTokenizer'''],
}

try:
						if not is_tokenizers_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						lowerCamelCase__			:					List[str]							  =					['''RetriBertTokenizerFast''']

try:
						if not is_torch_available():
												raise OptionalDependencyNotAvailable()
except OptionalDependencyNotAvailable:
						pass
else:
						lowerCamelCase__			:					List[str]							  =					[
						    '''RETRIBERT_PRETRAINED_MODEL_ARCHIVE_LIST''',
						    '''RetriBertModel''',
						    '''RetriBertPreTrainedModel''',
						]


if TYPE_CHECKING:
						from .configuration_retribert import RETRIBERT_PRETRAINED_CONFIG_ARCHIVE_MAP, RetriBertConfig
						from .tokenization_retribert import RetriBertTokenizer

						try:
												if not is_tokenizers_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .tokenization_retribert_fast import RetriBertTokenizerFast

						try:
												if not is_torch_available():
																		raise OptionalDependencyNotAvailable()
						except OptionalDependencyNotAvailable:
												pass
						else:
												from .modeling_retribert import (
												    RETRIBERT_PRETRAINED_MODEL_ARCHIVE_LIST,
												    RetriBertModel,
												    RetriBertPreTrainedModel,
												)

else:
						import sys

						lowerCamelCase__			:					str							  =					_LazyModule(__name__, globals()['''__file__'''], _import_structure, module_spec=__spec__)








"""simple docstring"""






def  UpperCamelCase   (     _lowerCAmelCase       :  int	)			->     str:
	_UpperCAmelCase      :							Any       =   len(_lowerCAmelCase	)
	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      :							List[str]       =   lst[j + 1]
				_UpperCAmelCase      :							Optional[int]       =   lst[j]
				_UpperCAmelCase      :							Optional[int]       =   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      :							Any       =   lst[no_of_elements - 1 - j]
				_UpperCAmelCase      :							Optional[Any]       =   lst[no_of_elements - 2 - j]
				_UpperCAmelCase      :							Optional[Any]       =   temp
	return lst


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





