

def    _snake_case		(snake_case_				:    list     )       ->		list:
  __UpperCAmelCase  :     str		=    len(snake_case_     )

  # Set the gap value to be decreased by a factor of 1.3
  # after each iteration
  __UpperCAmelCase  :     List[str]		=    1.3

  # Continue sorting until the gap is 1
  while gap > 1:
    # Decrease the gap value
    __UpperCAmelCase  :     List[Any]		=    int(gap / shrink     )

    # Sort the elements using insertion sort
    for i in range(snake_case_						,					len(snake_case_     )     ):
      __UpperCAmelCase  :     Dict		=    collection[i]
      __UpperCAmelCase  :     Optional[int]		=    i
      while j >= gap and collection[j - gap] > temp:
        __UpperCAmelCase  :     Union[str, Any]		=    collection[j - gap]
        j -= gap
      __UpperCAmelCase  :     Optional[Any]		=    temp

  return collection


if __name__ == "__main__":
      import doctest

      doctest.testmod()








from __future__ import annotations

from collections.abc import Iterable
from dataclasses import dataclass
from typing import Any


class     lowerCamelCase_   :
 _lowerCAmelCase       		=  ('''_front''', '''_back''', '''_len''')


 @dataclass
 class     lowerCamelCase_   :
  _lowerCAmelCase       		=  None
  _lowerCAmelCase       		=  None
  _lowerCAmelCase       		=  None



 class     lowerCamelCase_   :
  _lowerCAmelCase       		=  ('''_cur''',)




  def __init__( self     ,     _UpperCAmelCase       ):
    __UpperCAmelCase  :     Tuple		=    cur




  def __iter__( self       ):
    return self




  def 						a					( self       ):
    if self._cur is None:
      # finished iterating
      raise StopIteration
    __UpperCAmelCase  :     str		=    self._cur.val
    __UpperCAmelCase  :     Dict		=    self._cur.next_node

    return val




 def __init__( self     ,     _UpperCAmelCase = None       ):
   __UpperCAmelCase  :     Any		=    None
   __UpperCAmelCase  :     Any		=    None
   __UpperCAmelCase  :     int		=    0

   if iterable is not None:
     # append every value to the deque
     for val in iterable:
       self.append(_UpperCAmelCase       )




 def 						a					( self     ,     _UpperCAmelCase       ):
   __UpperCAmelCase  :     Optional[Any]		=    self._Node(_UpperCAmelCase     ,     _UpperCAmelCase     ,     _UpperCAmelCase       )
   if self.is_empty():
     # front = back
     __UpperCAmelCase  :     Dict		=    node
     __UpperCAmelCase  :     List[str]		=    1
   else:
     # connect nodes
     __UpperCAmelCase  :     Any		=    node
     __UpperCAmelCase  :     Tuple		=    self._back
     __UpperCAmelCase  :     Optional[Any]		=    node  # assign new back to the new node

     self._len += 1

     # make sure there were no errors
     assert not self.is_empty(), "Error on appending value."




 def 						a					( self     ,     _UpperCAmelCase       ):
   __UpperCAmelCase  :     Optional[Any]		=    self._Node(_UpperCAmelCase     ,     _UpperCAmelCase     ,     _UpperCAmelCase       )
   if self.is_empty():
     # front = back
     __UpperCAmelCase  :     str		=    node
     __UpperCAmelCase  :     List[str]		=    1
   else:
     # connect nodes
     __UpperCAmelCase  :     List[str]		=    self._front
     __UpperCAmelCase  :     Any		=    node
     __UpperCAmelCase  :     Dict		=    node  # assign new front to the new node

     self._len += 1

     # make sure there were no errors
     assert not self.is_empty(), "Error on appending value."




 def 						a					( self     ,     _UpperCAmelCase       ):
   for val in iterable:
     self.append(_UpperCAmelCase       )




 def 						a					( self     ,     _UpperCAmelCase       ):
   for val in iterable:
     self.appendleft(_UpperCAmelCase       )




 def 						a					( self       ):
   assert not self.is_empty(), "Deque is empty."

   __UpperCAmelCase  :     List[Any]		=    self._back
   __UpperCAmelCase  :     Optional[int]		=    self._back.prev_node  # set new back
   # drop the last node - python will deallocate memory automatically
   __UpperCAmelCase  :     int		=    None

   self._len -= 1

   return topop.val




 def 						a					( self       ):
   assert not self.is_empty(), "Deque is empty."

   __UpperCAmelCase  :     List[Any]		=    self._front
   __UpperCAmelCase  :     Union[str, Any]		=    self._front.next_node  # set new front and drop the first node
   __UpperCAmelCase  :     Union[str, Any]		=    None

   self._len -= 1

   return topop.val




 def 						a					( self       ):
   return self._front is None




 def __len__( self       ):
   return self._len




 def __eq__( self     ,     _UpperCAmelCase       ):

   if not isinstance(_UpperCAmelCase     ,     _UpperCAmelCase       ):
     return NotImplemented

   __UpperCAmelCase  :     List[str]		=    self._front
   __UpperCAmelCase  :     str		=    other._front

   # if the length of the dequeues are not the same, they are not equal
   if len(self       ) != len(_UpperCAmelCase       ):
     return False

   while me is not None and oth is not None:
     # compare every value
     if me.val != oth.val:
       return False
     __UpperCAmelCase  :     Any		=    me.next_node
     __UpperCAmelCase  :     str		=    oth.next_node

   return True




 def __iter__( self       ):
   return Deque._Iterator(self._front       )




 def __repr__( self       ):
   __UpperCAmelCase  :     int		=    []
   __UpperCAmelCase  :     Dict		=    self._front
   while aux is not None:
     # append the values in a list to display
     values_list.append(aux.val       )
     __UpperCAmelCase  :     List[str]		=    aux.next_node

   return F"[{', '.join(repr(_UpperCAmelCase       ) for val in values_list       )}]"


if __name__ == "__main__":
      import doctest

      doctest.testmod()





