Answer: Bulleted or numbered lists, presenting data in tables, and the formatting one.
Explanation: I’m taking the test and i’m pretty sure that’s right, lmk if you got a better answer though!
ANSWER: The teachers make it clear which of the notes should be included. They usually say these sentences:
1. "Here's what you should remember" - This indicates that it should be included in the notes and is important.
2. "This is important" - This is a direct statement that is it important and may come in an examination. It also indicates that this notes may have been useful in the past exams.
3. "Include this in your notes" - Here the teacher is directly instructing the student to include it in the notes as it is very important for him/her.
Answer:
Using Merge Sort.
Explanation:
Merge Sort is preferred for sorting the linked list because the the data stored in linked list is not in serial memory address which makes the quick sort algorithm very slow and other sorting algorithms impossible.
Merge Sort is a divide and conquer algorithm.
In this algorithms we divide the linked list into sub parts and sort the sub parts of the linked list and then we merge them in sorted order. It is a very effective approach for linked list sorting.
The time complexity of merge sort is O(NLogN).
