C++ Arrays Week 2

What is an array in C++?

• An array in C++ is a type of loop structure

• An array in C++ is a keyword used to declare variables

• An array in C++ is a data structure that can store a fixed-size sequential collection of elements of the same type.

• An array in C++ is a built-in function for sorting data

How do you declare an array in C++?

• int myArray[5];

• array myArray[5];

• int myArray{};

• myArray = new int[5];

What is the syntax for accessing elements in an array?

• array[index]

• arr[element]

• arr{index}

• arr[index]

Can the size of an array be changed once it is declared?

• No

• Only 1 time can be changed

• Sometimes

• Anytime when required.

How do you initialize an array in C++?

• int arr[5] = [0];

• int arr[] = {1, 2, 3, 4, 5};

• int arr[5] = [1, 2, 3];

• int arr(5) = {1, 2, 3, 4, 5};

What is the index of the first element in an array?

• -1

• 10

• 1

• 0

How do you find the length of an array in C++?

• Use the 'sizeof()' method to find the length of an array in C++.

• Access the 'size' attribute to get the length of an array in C++.

• Call the 'count()' function to determine the length of an array in C++.

• Use the 'length()' method to find the length of an array in C++.

What happens if you try to access an element outside the bounds of an array?

• Array Overflow error

• Memory leak

• Segmentation fault

• Index Out of Bounds error

_________________ arrays in C++ are arrays that have more than one dimension. They are essentially arrays of arrays, allowing for the creation of tables or matrices. Each element in a multi-dimensional array is accessed using multiple indices corresponding to each dimension.

What is the worst-case time complexity of using bubble sort to sort an array?

• O(n)

• O(n log n)

• O(n^2)

• O(2^n)

Answer explanation

Bubble sort has a worst-case time complexity of O(n^2), where N round * N compare = N^2.