I need help writing an algorithm. "Human Machine"$-$ find min.

Design an algorithm to find the smallest item in a list. Describe the processthat a prrson must go through when yhey are finding the smallest item. We will use playing cards face down on the table to represent a list of items. Start with $8$ random catds face down in a row. Any card on the table must be face down. When acting a the machine, you pick up a card with either hand, but each hand can only hold one card at a time. You look at and compare the values of any cards you are holdingto determine which one is greater than the other. You put a card back down on the table $($face down$),$ but once a card is face down on the table you cannot remember $($memorize$)$ its value or position. The algorithm must have a clear end to it$.$ The last instruction should be to say "I found it$!"$ and hold up the card with the lowest value. The algorithm should be written so that it will theoretically work for any number of cards $(1$ to $1$ million$).$ The instructions can refer to the values on yhe cards, and a person's hands but a systematic way for finding the smallest card must be invented. Keep in mind that there are face cards in a deck of cards. These cards will each have to be assigned a value. Make use of REPEAT and END REPEAT in the algorithm.