Which of the following results in faster access to internal tables?

Comprehensive and Detailed Explanation From Exact Extract:

Sorted tables:

Full key lookup uses a binary search → efficient (A).

Left-aligned partial key lookup also benefits from sort order to find ranges efficiently (C).

Hashed tables:

Require the complete key for O(1) access; partial key is not supported. Hence (E) is correct and (D) is not.

Standard tables:

Have no inherent ordering/index for key-based access; specifying a key (even partially) results in linear search unless you maintain sort and specify BINARY SEARCH explicitly, which still doesn’t change the fundamental case in this question; thus (B) is not considered a faster pattern here.

Study Guide Reference: ABAP Cloud Programming—Internal Tables (standard/sorted/hashed) performance characteristics.