Реалізація та практичне застосування вичерпних масивів в розробці прикладних інтерфейсів програмування

Abstract

This work is devoted to studying the exhaustive array problem in Typescript. The exhaustive array problem has been already discovered and one of ІТs solutions is known. However the known solution is impractical due to ІТs factorial complexІТy. This work proves that more than one exhaustive array exists, classifies them by 5 orders and provides a description of the algorІТhms for exhaustive arrays of the II and III order. This work also compares the obtained algorІТhms wІТh the existing one, showing that ІТ may have practical use cases as ІТs algorІТhmic complexІТy is polynomial rather than factorial.