This represents linear time complexity, which means that the execution time increases linearly as the input size increases. Examples include linear search and some sorting algorithms like bubble sort and insertion sort.
This represents linear time complexity, which means that the execution time increases linearly as the input size increases. Examples include linear search and some sorting algorithms like bubble sort and insertion sort.