In Bubble Sort, after the first complete pass through an array of n elements (sorted ascending), which element is guaranteed to be in its correct final position?

In a program split into two files (say_hello.h and say_hello.c), where should the function prototype be placed?

What is the main objective of a variable?

What is printed?

push(10);

push(20);

push(30);

pop();

printf("%d", peek());

Consider the following code:

struct node {

    int data;

    struct node *next;

};

struct node *head = NULL;

void insert(int data) {

    struct node *n = malloc(sizeof(struct node));

    n->data = data;

    n->next = head;

    head = n;

}

After executing:

insert(10);

insert(20);

insert(30);

What is the correct order of elements in the list?

Comparing Linear Search and Binary Search, which statement is true?

#include <stdio.h>

int main() {

int x=10;

printf("%d, %d, %d\n", x<1, x=100, x>=10);

return 0;

}

What is the output of this program?

#include<stdio.h>

int main() {

int a[5] = {4, 9, 1, 5, 6};

printf("%d \n", *(a+2));

return 0;

}

In the Insertion Sort algorithm, what happens in the while loop?