code: 
  
  
  
  
  
  
  import random
  
  class 					snake_case_							:
  
  
  
  
  
  
  
     """simple docstring"""
  
  
  
     def __init__(    self:	str   ,       snake_case__:	list[list[float]]   ,       snake_case__:	list[int]   ,       snake_case__:	float = 0.01   ,       snake_case__:	int = 1_000   ,       snake_case__:	float = -1   ,       )  ->		None:
  
  
         """simple docstring"""
  
  
  
         _lowercase     =	sample
         if len(self.sample	) == 0:
             raise ValueError('Sample data can not be empty'	)
         _lowercase     =	target
         if len(self.target	) == 0:
             raise ValueError('Target data can not be empty'	)
         if len(self.sample	) != len(self.target	):
             raise ValueError('Sample data and Target data do not have matching lengths'	)
         _lowercase     =	learning_rate
         _lowercase     =	epoch_number
         _lowercase     =	bias
         _lowercase     =	len(snake_case__	)
         _lowercase     =	len(sample[0]	)  # number of columns in dataset
         _lowercase     =	[]
  
     def 			SCREAMING_SNAKE_CASE__				(    self:	int	)  ->		None:
  
  
         """simple docstring"""
  
  
  
         for sample in self.sample:
             sample.insert(0   ,       self.bias	)
  
         for _ in range(self.col_sample	):
             self.weight.append(random.random()	)
  
         self.weight.insert(0   ,       self.bias	)
  
         _lowercase     =	0
  
         while True:
             _lowercase     =	False
             for i in range(self.number_sample	):
                 _lowercase     =	0
                 for j in range(self.col_sample + 1	):
                     _lowercase     =	u + self.weight[j] * self.sample[i][j]
                 _lowercase     =	self.sign(snake_case__	)
                 if y != self.target[i]:
                     for j in range(self.col_sample + 1	):
                         _lowercase     =	(
                             self.weight[j]
                             + self.learning_rate
                             * (self.target[i] - y)
                             * self.sample[i][j]
                         )
                     _lowercase     =	True
              # print('Epoch: \n',epoch_count)
             _lowercase     =	epoch_count + 1
             # if you want control the epoch or just by error
             if not has_misclassified:
                 print(('\nEpoch:\n', epoch_count)	)
                 print('------------------------\n'	)
                 # if epoch_count > self.epoch_number or not error:
                 break
  
     def 			SCREAMING_SNAKE_CASE__				(    self:	Tuple   ,       snake_case__:	list[float]	)  ->		None:
  
  
         """simple docstring"""
  
  
  
         if len(self.sample	) == 0:
             raise ValueError('Sample data can not be empty'	)
         sample.insert(0   ,       self.bias	)
         _lowercase     =	0
         for i in range(self.col_sample + 1	):
             _lowercase     =	u + self.weight[i] * sample[i]
  
         _lowercase     =	self.sign(snake_case__	)
  
         if y == -1:
             print(('Sample: ', sample)	)
             print('classification: P1'	)
         else:
             print(('Sample: ', sample)	)
             print('classification: P2'	)
  
     def 			SCREAMING_SNAKE_CASE__				(    self:	Union[str, Any]   ,       snake_case__:	float	)  ->		int:
  
  
         """simple docstring"""
  
  
  
         return 1 if u >= 0 else -1
  
  
  
  
  
  
  lowerCamelCase										=  [
      [-0.6508, 0.1097, 4.0009],
      [-1.4492, 0.8896, 4.4005],
      [2.0850, 0.6876, 12.0710],
      [0.2626, 1.1476, 7.7985],
      [0.6418, 1.0234, 7.0427],
      [0.2569, 0.6730, 8.3265],
      [1.1155, 0.6043, 7.4446],
      [0.0914, 0.3399, 7.0677],
      [0.0121, 0.5256, 4.6316],
      [-0.0429, 0.4660, 5.4323],
      [0.4340, 0.6870, 8.2287],
      [0.2735, 1.0287, 7.1934],
      [0.4839, 0.4851, 7.4850],
      [0.4089, -0.1267, 5.5019],
      [1.4391, 0.1614, 8.5843],
      [-0.9115, -0.1973, 2.1962],
      [0.3654, 1.0475, 7.4858],
      [0.2144, 0.7515, 7.1699],
      [0.2013, 1.0014, 6.5489],
      [0.6483, 0.2183, 5.8991],
      [-0.1147, 0.2242, 7.2435],
      [-0.7970, 0.8795, 3.8762],
      [-1.0625, 0.6366, 2.4707],
      [0.5307, 0.1285, 5.6883],
      [-1.2200, 0.7777, 1.7252],
      [0.3957, 0.1076, 5.6623],
      [-0.1013, 0.5989, 7.1812],
      [2.4482, 0.9455, 11.2095],
      [2.0149, 0.6192, 10.9263],
      [0.2012, 0.2611, 5.4631],
  ]
  
  lowerCamelCase										=  [
      -1,
      -1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      1,
      1,
      -1,
      1,
      -1,
      -1,
      -1,
      -1,
      1,
      1,
      1,
      1,
      -1,
      1,
      1,
      1,
      1,
      -1,
      -1,
      1,
      -1,
      1,
  ]
  
  
  if __name__ == "__main__":
     import doctest
  
     doctest.testmod()
  
     lowerCamelCase										=  Perceptron(
         sample=samples, target=target, learning_rate=0.01, epoch_number=1000, bias=-1
     )
     network.training()
     print('''Finished training perceptron''')
     print('''Enter values to predict or q to exit''')
     while True:
        lowerCamelCase										=  []
        for i in range(len(samples[0])):
           lowerCamelCase										=  input('''value: ''').strip()
           if user_input == "q":
              break
           lowerCamelCase										=  float(user_input)
           sample.insert(i, observation)
        network.sort(sample)
  
style_context: 
  
  
  
  
  
  
  from __future__ import annotations
  def        UpperCAmelCase      (   _lowercase,      _lowercase      ):
  
  
      '''simple docstring'''
  
  
  
      _lowercase     =	[None] * (len(_lowercase      ) + len(_lowercase      ))
  
      _lowercase     =	0  # pointer to current index for left Half
      _lowercase     =	0  # pointer to current index for the right Half
      _lowercase     =	0  # pointer to current index for the sorted array Half
  
      while pointera < len(_lowercase      ) and pointera < len(_lowercase      ):
          if left_half[pointera] < right_half[pointera]:
              _lowercase     =	left_half[pointera]
              pointera += 1
              index += 1
          else:
              _lowercase     =	right_half[pointera]
              pointera += 1
              index += 1
      while pointera < len(_lowercase      ):
          _lowercase     =	left_half[pointera]
          pointera += 1
          index += 1
  
      while pointera < len(_lowercase      ):
          _lowercase     =	right_half[pointera]
          pointera += 1
          index += 1
  
      return sorted_array
  def        UpperCAmelCase      (   _lowercase      ):
  
  
      '''simple docstring'''
  
  
  
      if len(_lowercase      ) <= 1:
          return array
      # the actual formula to calculate the middle element = left + (right - left) // 2
      # this avoids integer overflow in case of large N
      _lowercase     =	0 + (len(_lowercase      ) - 0) // 2
  
      # Split the array into halves till the array length becomes equal to One
      # merge the arrays of single length returned by mergeSort function and
      # pass them into the merge arrays function which merges the array
      _lowercase     =	array[:middle]
      _lowercase     =	array[middle:]
  
      return merge(merge_sort(_lowercase      ),      merge_sort(_lowercase      )      )
  
  
  if __name__ == "__main__":
     import doctest
  
     doctest.testmod()
  