Exploring Arrays and Algorithms

What is a one-dimensional array?

• A one-dimensional array is a two-dimensional structure of data.

• A one-dimensional array is a collection of elements with multiple indices.

• A one-dimensional array is a type of function that returns multiple values.

• A one-dimensional array is a linear collection of elements, accessible by a single index.

How does a multidimensional array differ from a one-dimensional array?

• A multidimensional array uses a single index for access, while a one-dimensional array uses multiple indices.

• A multidimensional array has multiple indices for access, while a one-dimensional array has a single index.

• A multidimensional array can only store numbers, while a one-dimensional array can store any data type.

• A multidimensional array is always larger in size than a one-dimensional array.

What are some common applications of arrays?

• Storing user passwords securely

• Creating web pages with HTML

• Common applications of arrays include data storage, sorting algorithms, image processing, and implementing data structures like stacks and queues.

• Generating random numbers in Python

Explain the concept of linear search.

• Linear search uses a binary tree structure to find values.

• Linear search sorts the list before searching for a target.

• Linear search requires the list to be sorted for efficiency.

• Linear search is an algorithm that sequentially checks each element in a list to find a target value.

Describe how binary search works.

• Binary search can be used on unsorted data without any preprocessing.

• Binary search requires a linear scan of the entire list.

• Binary search is an efficient algorithm for finding an item from a sorted list of items by repeatedly dividing the search interval in half.

• Binary search works by sorting the list before searching.

What is Fibonacci search and how does it differ from binary search?

• Fibonacci search is a search algorithm that uses Fibonacci numbers for division, differing from binary search which divides the array into two equal halves.

• Fibonacci search divides the array into three equal parts instead of two.

• Fibonacci search is a sorting algorithm that organizes data using Fibonacci numbers.

• Binary search is faster than Fibonacci search because it uses a linear approach.

How does bubble sort operate on an array?

• Bubble sort sorts elements by dividing the array into two halves.

• Bubble sort only compares the first and last elements of the array.

• Bubble sort repeatedly compares and swaps adjacent elements in an array until it is sorted.

• Bubble sort uses a recursive approach to sort the array.

Explain the concept of insertion sort.

• Insertion sort is a sorting algorithm that sorts an array by repeatedly taking an element from the unsorted part and inserting it into the correct position in the sorted part.

• Insertion sort is a sorting algorithm that only works on linked lists.

• Insertion sort is a method for merging two sorted arrays into one.

• Insertion sort is a technique for finding the maximum element in an array.

What is heap sort and how does it function?

• Heap sort is a method for searching elements in a binary tree.

• Heap sort is a sorting technique that uses a linked list to organize data.

• Heap sort is a linear sorting algorithm that requires O(n) time.

• Heap sort is a sorting algorithm that uses a binary heap to sort elements in O(n log n) time.

Describe the merge sort algorithm.

• Merge sort is a sorting algorithm that does not use recursion.

• Merge sort is a divide-and-conquer algorithm that recursively splits and merges arrays.

• Merge sort only works on linked lists and not on arrays.

• Merge sort is a linear algorithm that sorts elements in a single pass.