|
Dynamic Programming
Advertisement |
Google SearchAdvertisement |
||||
| Performance tip: Hashed tables are optimized for single entry access, whereas sorted tables are optimized for partial sequential loop operations. Entries in hashed table have no specific order. Hence, a partial sequential access cannot be optimized. Every entry must be checked to match the condition (full table scan). |
Home 
ABAP Tutorials Dynamic Programming
ABAP Tutorials Dynamic Programming
Login
Statistics
Members : 1008Content : 102
Content View Hits : 83759
