From 842cb03da1e6f78da7eab08a89d6ee603d73f95d Mon Sep 17 00:00:00 2001
From: danrega <16720986+danrega@users.noreply.github.com>
Date: Mon, 28 Aug 2023 13:17:40 +0200
Subject: [PATCH] Correct typos

---
 01_Internal_Tables.md        | 2 +-
 16_Data_Types_and_Objects.md | 4 ++--
 2 files changed, 3 insertions(+), 3 deletions(-)

diff --git a/01_Internal_Tables.md b/01_Internal_Tables.md
index 573a502..515cde1 100644
--- a/01_Internal_Tables.md
+++ b/01_Internal_Tables.md
@@ -58,7 +58,7 @@ Internal Tables ...
 | Category | Internally managed by | Access | Primary table key | When to use | Hints |
 |---|---|---|---|---|---|
 |`STANDARD`|Primary table index (that's why these tables are called [index tables](https://help.sap.com/doc/abapdocu_cp_index_htm/CLOUD/en-US/index.htm?file=abenindex_table_glosry.htm))|<ul><li>Table index</li><li>Table key</li></ul>|<ul><li>Always non-unique, i.e. duplicate entries are always allowed</li><li>Definition of an empty key is possible if the key is not relevant(`WITH EMPTY KEY`)</li></ul>|<ul><li>If you primarily access the table content for sequential processing or via the table index.</li><li>Response time for accessing the table using the primary key: This kind of table access is optimized only for sorted and hashed tables. For standard tables, primary key access uses a linear search across all lines. That means that large standard tables (more than 100 lines) are not ideal if the you primarily access the table using the table key.</></ul>|<ul><li>There is no particular sort order, but the tables can be sorted using `SORT`.</li><li>Filling this kind of table: Lines are either appended at the end of the table or inserted at a specific position.</li><li>[Secondary table keys](https://help.sap.com/doc/abapdocu_cp_index_htm/CLOUD/en-US/index.htm?file=abensecondary_table_key_glosry.htm) can be defined to make key access to standard tables more efficient.</li><li>Standard and sorted tables have the least [administration costs (F1 docu for standard ABAP)](https://help.sap.com/doc/abapdocu_latest_index_htm/latest/en-US/index.htm?file=abenadmin_costs_dyn_mem_obj_guidl.htm).</li></ul>|
-|`SORTED`|Primary table index (that's why these tables are called [index tables](https://help.sap.com/doc/abapdocu_cp_index_htm/CLOUD/en-US/index.htm?file=abenindex_table_glosry.htm))|<ul><li>Table index</li><li>Table key</li></ul>|<ul><li>Non-unique</li><li>Unique</li><br>... used to sort the table in ascending order.</ul>|<ul><li>Enables an optimized access to table content using table key and index.</li><li>If access via table key is the main access method, but no unique key can be defined.</li></ul>|<ul><li>Sorting is done automatically when lines are inserted or deleted. As a consequnce, the table index must usually be reorganized. </li><li>The response time for accessing the table using the primary key depends logarithmically on the number of table entries, since a binary search is used.</li><li>Standard and sorted tables have the least administration costs.</li></ul>|
+|`SORTED`|Primary table index (that's why these tables are called [index tables](https://help.sap.com/doc/abapdocu_cp_index_htm/CLOUD/en-US/index.htm?file=abenindex_table_glosry.htm))|<ul><li>Table index</li><li>Table key</li></ul>|<ul><li>Non-unique</li><li>Unique</li><br>... used to sort the table in ascending order.</ul>|<ul><li>Enables an optimized access to table content using table key and index.</li><li>If access via table key is the main access method, but no unique key can be defined.</li></ul>|<ul><li>Sorting is done automatically when lines are inserted or deleted. As a consequence, the table index must usually be reorganized. </li><li>The response time for accessing the table using the primary key depends logarithmically on the number of table entries, since a binary search is used.</li><li>Standard and sorted tables have the least administration costs.</li></ul>|
 |`HASHED`|Hash algorithm |<ul><li>Table key</li><li>[Secondary table index](https://help.sap.com/doc/abapdocu_cp_index_htm/CLOUD/en-US/index.htm?file=abensecondary_table_index_glosry.htm)</li></ul>|Always unique|<ul><li>For large internal tables.</li><li>Optimized for key access. Access to table content via table key is the main access method and a unique key can be defined.</li></ul>|<ul><li>The response time for primary key access is constant and independent of the number of entries in the table.</li><li>Hashed tables have the highest administration costs.</li></ul>|
 
 
diff --git a/16_Data_Types_and_Objects.md b/16_Data_Types_and_Objects.md
index dcdcf65..1c04f3c 100644
--- a/16_Data_Types_and_Objects.md
+++ b/16_Data_Types_and_Objects.md
@@ -525,7 +525,7 @@ str_a1 = to_upper( str_a2 ).
 
 "Constructor expressions as source of the assignment
 "There are various options and expressions available (with many additions). Check the
-"ABAP Keyword Documentation and the ABAP cheat sheet abouot constructor expressions.
+"ABAP Keyword Documentation and the ABAP cheat sheet about constructor expressions.
 "Here, taking the VALUE operator as an example. This operator is very handy especially
 "for complex types.
 
@@ -539,7 +539,7 @@ some_struc = VALUE #( carrid = 'XY' carrname = 'XY Airways' ).
 
 "Creating an internal table and assigning values
 "Note that components that are not specified and assigned a value retain their
-"type-specific ininial value.
+"type-specific initial value.
 DATA some_itab TYPE TABLE OF zdemo_abap_carr WITH EMPTY KEY.
 some_itab = VALUE #( ( carrid = 'XY' carrname = 'XY Airways' )
                      ( carrid = 'AB' carrname = 'ABAP Airlines' ) ) .