66 lines
2.1 KiB
Python
66 lines
2.1 KiB
Python
|
#!/usr/bin/env python3
|
||
|
|
# -*- coding: utf-8 -*-
|
||
|
|
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
# IMPORTS
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
|
||
|
|
from local.maths import *;
|
||
|
|
from local.typing import *;
|
||
|
|
|
||
|
|
from code.core.log import *;
|
||
|
|
from code.algorithms.search.sequential import SequentialSearch;
|
||
|
|
from code.algorithms.methods import *;
|
||
|
|
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
# GLOBAL VARIABLES/CONSTANTS
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
|
||
|
|
#
|
||
|
|
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
# CHECKS
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
|
||
|
|
def preChecks(L: List[int], i: int, **_):
|
||
|
|
assert 1 <= i and i <= len(L), 'Der Wert von i muss zw. {lb} und {ub} liegen.'.format(lb = 1, ub = len(L));
|
||
|
|
assert sorted(L) == sorted(list(set(L))), 'Ungültiger Input: L darf keine Duplikate enthalten!';
|
||
|
|
return;
|
||
|
|
|
||
|
|
def postChecks(L: List[int], i: int, value: int, **_):
|
||
|
|
L_ = sorted(L);
|
||
|
|
assert L_[i-1] == value, 'Der Algorithmus hat versagt.';
|
||
|
|
return;
|
||
|
|
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
# ALGORITHM jump search
|
||
|
|
# ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
|
||
|
|
|
||
|
|
@algorithmInfos(name='Auswahlproblem (i. kleinstes Element)', outputnames='value', checks=True, metrics=True, preChecks=preChecks, postChecks=postChecks)
|
||
|
|
def FindIthSmallest(L: List[int], i: int) -> int:
|
||
|
|
'''
|
||
|
|
Inputs: L = Liste von Zahlen, i = Ordinalzahl
|
||
|
|
|
||
|
|
Annahmen:
|
||
|
|
|
||
|
|
- L enthält keine Duplikate.
|
||
|
|
- L enthält mindestens i Elemente.
|
||
|
|
|
||
|
|
Outputs: Wert des i. kleinste Element in L.
|
||
|
|
Beachte 1.kleinstes <==> Minimum.
|
||
|
|
'''
|
||
|
|
index = 0;
|
||
|
|
minValue = L[0];
|
||
|
|
AddToCounter(len(L));
|
||
|
|
for i_ in range(1, len(L)):
|
||
|
|
if L[i_] < minValue:
|
||
|
|
index = i_;
|
||
|
|
minValue = L[i_];
|
||
|
|
if i == 1:
|
||
|
|
logDebug('Das i. kleinste Element wurde gefunden.');
|
||
|
|
return minValue;
|
||
|
|
else:
|
||
|
|
logDebug('Entfernte Minimum: {value}.'.format(value = minValue));
|
||
|
|
i = i - 1;
|
||
|
|
return FindIthSmallest(L=L[:index] + L[(index+1):], i=i);
|