

from __future__ import annotations

def        lowerCamelCase__       (    _a							,	_a):
	# Checks if the entire collection has been sorted
	if len(_a) <= 1 or n <= 1:
		return

	insert_next(_a							,	n - 1)
	rec_insertion_sort(_a							,	n - 1)

def        lowerCamelCase__       (    _a							,	_a):
	# Checks order between adjacent elements
	if index >= len(_a) or collection[index - 1] <= collection[index]:
		return

	# Swaps adjacent elements since they are not in ascending order
	SCREAMING_SNAKE_CASE   ,SCREAMING_SNAKE_CASE      :					List[Any]    =				(
	    collection[index],
	    collection[index - 1],
	)

	insert_next(_a							,	index + 1)


if __name__ == "__main__":
			a_     =			input('Enter integers separated by spaces: ')
			a_     =			[int(num) for num in numbers.split()]
			rec_insertion_sort(number_list, len(number_list))
			print(number_list)


from .glue import GlueDataset, GlueDataTrainingArguments
from .language_modeling import (
    LineByLineTextDataset,
    LineByLineWithRefDataset,
    LineByLineWithSOPTextDataset,
    TextDataset,
    TextDatasetForNextSentencePrediction,
)
from .squad import SquadDataset, SquadDataTrainingArguments
