Find Top 3 Largest Values in an Array

updated printing approach.

#include <stdio.h>
#include <stdint.h>

void find_top_3(uint8_t *arr, uint8_t n) {
    uint8_t Ln = n, i;
    uint8_t largest[3] ;
    largest[0] = arr[0];        //max element holder
    largest[1] = largest[0];    //2nd max
    largest[2] = largest[0];    //3rd max
    // initialize the top 3 to arr[0] for now
    while(Ln--){
        if(arr[Ln] > largest[0]){
            largest[2] = largest[1];
            largest[1] = largest[0];
            largest[0] = arr[Ln];
        }
        else if(arr[Ln] > largest[1]){
            largest[2] = largest[1];
            largest[1] = arr[Ln];
        }
        else if(arr[Ln] > largest[2]){
            largest[2] = arr[Ln];
        }
    }
    Ln = (n<3) ? n : 3; 
    for(i = 0; i < Ln; i++){
        printf("%hhu", largest[i]);
        if(i < (Ln-1) ) {
            putchar(' ');
        }
    }
}

int main() {
    uint8_t n;
    scanf("%hhu", &n);
    uint8_t arr[100];

    for (uint8_t i = 0; i < n; i++) {
        scanf("%hhu", &arr[i]);
    }

    find_top_3(arr, n);
    return 0;
}

Solving Approach