Answer:
see explaination
Explanation:
#include <iostream>
#include <string>
using namespace std;
class LinkedList{
class Node{
public :
int data;
Node* next;
Node(int data){
this->data = data;
next = NULL;
}
};
public :
Node *head;
LinkedList(){
this->head = NULL;
}
void insert(int d){
Node* new_node = new Node(d);
new_node->next = head;
head = new_node;
}
// sort the list with selection sort algorithm.
// Pick the smallest element in the unsorted array and place in the first element in the unsorted.
void sort_list(){
if (head == NULL){
return;
}
Node* current = head;
while (current->next != NULL){
Node* min_node = current;
Node* traverse = current->next;
while(traverse != NULL){
if(traverse->data < min_node->data){
min_node = traverse;
}
traverse = traverse->next;
}
int temp = current->data;
current->data = min_node->data;
min_node->data = temp;
current = current->next;
}
}
void print_list(){
Node* current = head;
while(current !=NULL){
cout<<current->data<<" ";
current = current->next;
}
cout<<"\n";
}
};
int main(){
LinkedList ll;
for(int i=0;i<10;i++){
ll.insert(i);
}
ll.print_list();
cout<<"*******************************************\n";
ll.sort_list();
ll.print_list();
cout<<"*******************************************\n";
}
Based on the question, the Recommendation of a framework that will enable the analyst to install a kernel driver is said to be Volatility.
<h3>What is the Volatility framework?</h3>
Volatility is said to be a kind of an open source framework that is known to be used in times of memory forensics as well as digital investigations.
Note that The framework is one that tends to inspects and take out the memory artifacts that pertains to 32-bit and 64-bit systems. The framework has aided for all kinds of Linux, Windows, and others.
Hence, Based on the question, the Recommendation of a framework that will enable the analyst to install a kernel driver is said to be Volatility.
Learn more about Volatility from
brainly.com/question/27993482
#SPJ1
Answer:
True: In binary search algorithm, we follow the below steps sequentially:
Input: A sorted array B[1,2,...n] of n items and one item x to be searched.
Output: The index of x in B if exists in B, 0 otherwise.
- low=1
- high=n
- while( low < high )
- { mid=low + (high-low)/2
- if( B[mid]==x)
- {
- return(mid) //returns mid as the index of x
- }
- else
- {
- if( B[mid] < x) //takes only right half of the array
- {
- low=mid+1
- }
- else // takes only the left half of the array
- {
- high=mid-1
- }
- }
- }
- return( 0 )
Explanation:
For each iteration the line number 11 or line number 15 will be executed.
Both lines, cut the array size to half of it and takes as the input for next iteration.
The value of result of the code segment is executed is known to be 4.
<h3>Why is the value of the code segment so?</h3>
When the result of is not executed because the condition is said to be false and also when there is a false condition is, the else statement will be said to be true
Therefore, result = result + 2; -> result is brought up by 2 to bring about 4 and as such, the value of result of the code segment is executed is known to be 4.
Learn more about scores from
brainly.com/question/19492935
#SJ1