


"""simple docstring"""





from sklearn.metrics import accuracy_score

import datasets


__UpperCAmelCase    				=      "\nAccuracy is the proportion of correct predictions among the total number of cases processed. It can be computed with:\nAccuracy = (TP + TN) / (TP + TN + FP + FN)\n Where:\nTP: True positive\nTN: True negative\nFP: False positive\nFN: False negative\n"


__UpperCAmelCase    				=      "\nArgs:\n    predictions (`list` of `int`): Predicted labels.\n    references (`list` of `int`): Ground truth labels.\n    normalize (`boolean`): If set to False, returns the number of correctly classified samples. Otherwise, returns the fraction of correctly classified samples. Defaults to True.\n    sample_weight (`list` of `float`): Sample weights Defaults to None.\n\nReturns:\n    accuracy (`float` or `int`): Accuracy score. Minimum possible value is 0. Maximum possible value is 1.0, or the number of examples input, if `normalize` is set to `True`.. A higher score means higher accuracy.\n\nExamples:\n\n    Example 1-A simple example\n        >>> accuracy_metric = datasets.load_metric(\"accuracy\")\n        >>> results = accuracy_metric.compute(references=[0, 1, 2, 0, 1, 2], predictions=[0, 1, 1, 2, 1, 0])\n        >>> print(results)\n        {'accuracy': 0.5}\n\n    Example 2-The same as Example 1, except with `normalize` set to `False`.\n        >>> accuracy_metric = datasets.load_metric(\"accuracy\")\n        >>> results = accuracy_metric.compute(references=[0, 1, 2, 0, 1, 2], predictions=[0, 1, 1, 2, 1, 0], normalize=False)\n        >>> print(results)\n        {'accuracy': 3.0}\n\n    Example 3-The same as Example 1, except with `sample_weight` set.\n        >>> accuracy_metric = datasets.load_metric(\"accuracy\")\n        >>> results = accuracy_metric.compute(references=[0, 1, 2, 0, 1, 2], predictions=[0, 1, 1, 2, 1, 0], sample_weight=[0.5, 2, 0.7, 0.5, 9, 0.4])\n        >>> print(results)\n        {'accuracy': 0.8778625954198473}\n"


__UpperCAmelCase    				=      "\n@article{scikit-learn,\n  title={Scikit-learn: Machine Learning in {P}ython},\n  author={Pedregosa, F. and Varoquaux, G. and Gramfort, A. and Michel, V.\n         and Thirion, B. and Grisel, O. and Blondel, M. and Prettenhofer, P.\n         and Weiss, R. and Dubourg, V. and Vanderplas, J. and Passos, A. and\n         Cournapeau, D. and Brucher, M. and Perrot, M. and Duchesnay, E.},\n  journal={Journal of Machine Learning Research},\n  volume={12},\n  pages={2825--2830},\n  year={2011}\n}\n"

@datasets.utils.file_utils.add_start_docstrings(_DESCRIPTION							,							_KWARGS_DESCRIPTION						)
class  lowercase_  ( datasets.Metric						):







      def 				_lowerCAmelCase       (      self :							List[str]    ):
        return datasets.MetricInfo(
            description=_DESCRIPTION		,  citation=_CITATION		,  inputs_description=_KWARGS_DESCRIPTION		,  features=datasets.Features(
                {
                    "predictions": datasets.Sequence(datasets.Value("int32"    )    ),
                    "references": datasets.Sequence(datasets.Value("int32"    )    ),
                }
                if self.config_name == "multilabel"
                else {
                    "predictions": datasets.Value("int32"    ),
                    "references": datasets.Value("int32"    ),
                }    )		,  reference_urls=["https://scikit-learn.org/stable/modules/generated/sklearn.metrics.accuracy_score.html"]		,  )







      def 				_lowerCAmelCase       (      self :							int		,  _lowercase :							List[Any]		,  _lowercase :							Tuple		,  _lowercase :							Tuple=True		,  _lowercase :							List[Any]=None    ):
        return {
            "accuracy": float(
                accuracy_score(_lowercase		,  _lowercase		,  normalize=_lowercase		,  sample_weight=_lowercase    )    )
        }




"""simple docstring"""





from __future__ import annotations





def     lowercase__	(  lowerCamelCase     :  list				,	lowerCamelCase     :  list				)					->     list:
  lowerCAmelCase__    :    Dict								=					[None] * (len(lowerCamelCase				) + len(lowerCamelCase				))

  lowerCAmelCase__    :    Optional[Any]								=					0  # pointer to current index for left Half
  lowerCAmelCase__    :    Any								=					0  # pointer to current index for the right Half
  lowerCAmelCase__    :    Dict								=					0  # pointer to current index for the sorted array Half

  while pointera < len(lowerCamelCase				) and pointera < len(lowerCamelCase				):
    if left_half[pointera] < right_half[pointera]:
      lowerCAmelCase__    :    Tuple								=					left_half[pointera]
      pointera += 1
      index += 1
    else:
      lowerCAmelCase__    :    int								=					right_half[pointera]
      pointera += 1
      index += 1
  while pointera < len(lowerCamelCase				):
    lowerCAmelCase__    :    Tuple								=					left_half[pointera]
    pointera += 1
    index += 1

  while pointera < len(lowerCamelCase				):
    lowerCAmelCase__    :    Optional[int]								=					right_half[pointera]
    pointera += 1
    index += 1

  return sorted_array





def     lowercase__	(  lowerCamelCase     :  list				)					->     list:
  if len(lowerCamelCase				) <= 1:
    return array
  # the actual formula to calculate the middle element = left + (right - left) // 2
  # this avoids integer overflow in case of large N
  lowerCAmelCase__    :    Optional[int]								=					0 + (len(lowerCamelCase				) - 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
  lowerCAmelCase__    :    Union[str, Any]								=					array[:middle]
  lowerCAmelCase__    :    List[str]								=					array[middle:]

  return merge(merge_sort(lowerCamelCase				)				,	merge_sort(lowerCamelCase				)				)


if __name__ == "__main__":
   import doctest

   doctest.testmod()
