A weakly connected graph has a directed path between every pair of nodes,

A weakly connected graph must also be strongly connected.

In a weakly connected graph, there is an undirected path between every pair of

A weakly connected graph has no directed path between any pair of nodes.

A weakly connected graph has a directed path between every pair of nodes, but

It must have clear and unambiguous instructions

It must terminate after a finite number of steps

It must always run in polynomial time

It must take an input

It must produce an output

27

37

25

5

20

A queue allows you to add elements at the front, while a stack adds elements at the

A priority queue processes nodes in a depth-first manner, while a stack processes

A queue processes nodes in the order they are added, while a stack processes nodes

A stack is a first-in-first-out (FIFO) data structure, while a queue is last-in-first-out (LIFO)

A queues can process nodes level by level, while a priority queue always processes

4

3

1

2

5

4

3

1

2

5

[3, 5, 6, 7, 10, 8]

[3, 7, 5, 8, 10, 6]

[3, 7, 6, 10, 5, 8]

[3, 6, 5, 7, 10, 8]

[3, 7, 5, 10, 8, 6]

Quicksort is a stable sorting algorithm.

Quicksort performs better than merge sort in all cases.

Quicksort always uses the last element of the array as the pivot.

Quicksort has a worst-case time complexity of O( n log⁡n ).

The efficiency of quicksort depends heavily on the choice of the pivot.

The number of times an algorithm accesses memory

The best possible performance of an algorithm in ideal conditions

The performance of an algorithm for very small inputs

The execution speed of an algorithm on a specific machine

The growth rate of an algorithm’s running time as input size increases