Microsoft Word is a word processing program created by Microsoft that allows users to type documents, letters, and other content. The document provides instructions on how to use Microsoft Word by an author named MR.Klednatee Chaichana. While the document does not provide any specific details on how to use Word, it appears to be aimed at teaching users the basic functions and features of the popular word processing software.
The document discusses different data structures and sorting algorithms:
1. It describes arrays as a linear data structure where elements are stored in consecutive memory locations and can be accessed using an index.
2. It provides examples of traversing and manipulating arrays, such as inserting and deleting elements. Common sorting algorithms like bubble sort and selection sort are also summarized.
3. Bubble sort works by repeatedly stepping through the list and comparing adjacent elements, swapping them if they are in the wrong order until no swaps are needed, resulting in a sorted list in O(n^2) time. Selection sort finds the minimum element and swaps it into the front each iteration.
Microsoft Word is a word processing program created by Microsoft that allows users to type documents, letters, and other content. The document provides instructions on how to use Microsoft Word by an author named MR.Klednatee Chaichana. While the document does not provide any specific details on how to use Word, it appears to be aimed at teaching users the basic functions and features of the popular word processing software.
The document discusses different data structures and sorting algorithms:
1. It describes arrays as a linear data structure where elements are stored in consecutive memory locations and can be accessed using an index.
2. It provides examples of traversing and manipulating arrays, such as inserting and deleting elements. Common sorting algorithms like bubble sort and selection sort are also summarized.
3. Bubble sort works by repeatedly stepping through the list and comparing adjacent elements, swapping them if they are in the wrong order until no swaps are needed, resulting in a sorted list in O(n^2) time. Selection sort finds the minimum element and swaps it into the front each iteration.
