The performance of accessing an internal table depends on its type and how the key is specified.

- Sorted Tables: These tables are internally sorted by their primary key. Access using a binary search algorithm is possible if the specified key fields constitute a left-aligned, gapless part of the primary key. This makes access very fast (logarithmic time complexity). Therefore, specifying the key completely or partially from the left results in fast access.

- Hashed Tables: These tables use a hash algorithm to calculate a record's address based on its full primary key. This provides the fastest possible access (near-constant time complexity). However, this method requires all primary key fields to be specified; partial key access is not possible for the primary key.

C. In a standard internal table, specifying the primary key partially from the left without gaps.

Standard tables are searched linearly by default, which is slow for large tables. Fast access requires a secondary sorted key.

D. In a hashed internal table, specifying the primary key partially from the left without gaps.

Accessing a hashed table via its primary key requires all key fields to be specified to compute the hash value; partial keys are not supported.

1. SAP Help Portal

ABAP Keyword Documentation - READ TABLE - itabkey:

For Sorted Tables: "If the specified components form a left-aligned part of the table key

the search is binary... If not

the search is linear

as in standard tables." This supports answers A and B.

For Hashed Tables: "When a hashed table is accessed using WITH TABLE KEY

all components of the table key must be specified... The search uses the hash algorithm of the internal table." This supports answer E and invalidates D.

For Standard Tables: "The search is linear. The runtime is in linear relation to the number of table rows." This invalidates answer C.

2. SAP Help Portal

ABAP Keyword Documentation - TYPES - TABLE OF:

Section on WITH ... KEY: This documentation details the definition and access characteristics of each table kind. It explicitly states that sorted keys allow binary searches on initial parts of the key

while hashed keys require a full key specification for hash access. This provides foundational knowledge supporting the correct answers.