Aiming at the low efficiency in repairing failed nodes of fractional repetition codes, this study proposed a construction algorithm of Fractional Repetition codes based on Spanning trees of Harary graph (FRSH). As a result, FRSH codes have lower computational overhead in repairing bandwidth overhead and locality than RS codes and SRC. Besides, FRSH codes are more efficient and spend less time in repairing failed nodes, compared with the other two codes.