CodingBat tmhscs@gmail.com search

id/email
password

forgot password \| create account

about | help | code help+videos | done | prefs

CodingBat code practice

tmhscs@gmail.com search

 _      ____  ____     ___   ____  ____        _____   ___   ____  ____      __  __ __ 
| |    |    ||    \   /  _] /    ||    \      / ___/  /  _] /    ||    \    /  ]|  |  |
| |     |  | |  _  | /  [_ |  o  ||  D  )    (   \_  /  [_ |  o  ||  D  )  /  / |  |  |
| |___  |  | |  |  ||    _]|     ||    /      \__  ||    _]|     ||    /  /  /  |  _  |
|     | |  | |  |  ||   [_ |  _  ||    \      /  \ ||   [_ |  _  ||    \ /   \_ |  |  |
|     | |  | |  |  ||     ||  |  ||  .  \     \    ||     ||  |  ||  .  \\     ||  |  |
|_____||____||__|__||_____||__|__||__|\_|      \___||_____||__|__||__|\_| \____||__|__|

Linear search is an algorithm where you are searching for a value in a data structure, and simply iterate through each element from left-to-right looking for it. Use one for-loop and one if-statement to solve these problems, and make sure that you code it using left-to-right searching!

This video explains Linear Search in detail: https://www.youtube.com/watch?v=X4v0IFyA82U

01. linearSearch_array H
02. linearSearch_list H
03. linearSearch_string H
04. linearSearch_access H

 ____   ____  ____    ____  ____   __ __       _____   ___   ____  ____      __  __ __ 
|    \ |    ||    \  /    ||    \ |  |  |     / ___/  /  _] /    ||    \    /  ]|  |  |
|  o  ) |  | |  _  ||  o  ||  D  )|  |  |    (   \_  /  [_ |  o  ||  D  )  /  / |  |  |
|     | |  | |  |  ||     ||    / |  ~  |     \__  ||    _]|     ||    /  /  /  |  _  |
|  O  | |  | |  |  ||  _  ||    \ |___, |     /  \ ||   [_ |  _  ||    \ /   \_ |  |  |
|     | |  | |  |  ||  |  ||  .  \|     |     \    ||     ||  |  ||  .  \\     ||  |  |
|_____||____||__|__||__|__||__|\_||____/       \___||_____||__|__||__|\_| \____||__|__|

Binary search is an algorithm where you are searching for a value in a data structure, and look at the middle element of a data and can immediately rule-out half of the data set. Use one while-loop and integers for left, right, and middle to bisect the data set. If you do not solve these questions using the binary search algorithm, you will receive a zero.

This video explains Binary Search in detail: https://www.youtube.com/watch?v=C581ZRWcAxM

05. binarySearch_array H
06. binarySearch_list H
07. binarySearch_string H
08. binarySearch_access H

Authoring docs