Sequential Search Algorithm (Linear Search)
Sequential Search Algorithm (Linear Search) 순차탐색 Less used than binary search and Hash Table. Big-O notation for Sequential Search is O(n) which is relatively slower than others. public class Main { public static void main(String[] args) { int arr[] = {7, 4, 3, 1, 5}; int x = 3; int answer = linearSearch(arr, x); if(answer == -1){ System.out.println("No element matched"); }else{ System.out.print..
Algorithms
2019. 7. 30. 06:02
공지사항
최근에 올라온 글
최근에 달린 댓글
- Total
- Today
- Yesterday
링크
TAG
- 프로그래머스 알고리즘
- algorithm
- HackerRank Algorithm
- C++
- spring boot application
- math.abs
- rest parameter
- HashMap
- substring()
- javascript
- Javascript Algorithm
- code refactoring
- ... in Javascript
- Object type casting
- 알고리즘
- easy algorithm
- hackerrank javascript solution
- compareTo()
- java
- hackerrank
- string class in java
- repeat()
- hackerrank javascript
- math.max
- 프로그래머스 알고리즘문제
- 프로그래머스
- Collection Framework
- hackerrank solution
- equals()
- easy javascript algorithm
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | ||||||
| 2 | 3 | 4 | 5 | 6 | 7 | 8 |
| 9 | 10 | 11 | 12 | 13 | 14 | 15 |
| 16 | 17 | 18 | 19 | 20 | 21 | 22 |
| 23 | 24 | 25 | 26 | 27 | 28 |
글 보관함