FrontEnd :-)

COMPARISON SORTS Average Time Complexity Bubble Sort - O(n^2) Insertion Sort - O(n^2) Selection Sort - O(n^2) Quick Sort - O(n log (n)) Merge Sort - O(n log (n)) RADIX SORT | 기수 정렬 Radix sort is a special sorting algorithm that works on lists of numbers It never makes comparisons between elements! It exploits the fact that information about the size of a number is encoded in the number of digits..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 Intermediate Sorting Algorithms Quick Sort | 퀵 정렬 Like merge sort, exploits the fact that arrays of 0 or 1 element are always sorted Works by selecting one element (called the "pivot") and finding the index where the pivot should end up in the sorted array Once the pivot is positioned appropriately, quick sort can be applied on either side of the pivo..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 Intermediate Sorting Algorithms WHY LEARN THIS? The sorting algorithms we've learned so far don't scale well Try out bubble sort on an array of 100000 elements, it will take quite some time! We need to be able to sort large arrays more quickly Merge Sort | 합병 정렬 It's a combination of two things - merging and sorting! Exploits the fact that arrays of 0..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 Selection Sort 선택 정렬 Similar to bubble sort, but instead of first placing large values into sorted position, it places small values into sorted position Selection Sort Pseudocode Store the first element as the smallest value you've seen so far. Compare this item to the next item in the array until you find a smaller number. If a smaller number is foun..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 Elementary Sorting Algorithms | 정렬 알고리즘 What is sorting? Sorting is the process of rearranging the items in a collection (e.g. an array) so that the items are in some kind of order. Examples Sorting numbers from smallest to largest Sorting names alphabetically Sorting movies based on release year Sorting movies based on revenue Sorting is an incredibl..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 How do we search? Given an array, the simplest way to search for an value is to look at every element in the array and check if it's the value we want. JavaScript has search! There are many different search methods on arrays in JavaScript: indexOf includes find findIndex Linear Search Pseudocode This function accepts an array and a value Loop through ..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 #Prac 10. power Write a function called power which accepts a base and an exponent. The function should return the power of the base to the exponent. This function should mimic the functionality of Math.pow() - do not worry about negative bases and exponents. 🅰️ (제출 답) ✅ (풀이 과정) // power(2,0) // 1 // power(2,2) // 4 // power(2,4) // 16 function power(..

Udemy - 【한글자막】 JavaScript 알고리즘 & 자료구조 마스터클래스 재귀는 자기 자신을 호출하는 함수. * 중단점(종료점) 반드시 있어야 함! * 스택 오버플로는 재귀가 멈추지 않는다는 의미. 종료점이 없을 때. # 재귀 함수 예제 1 // Recursive Version function countDown(num){ if(num 0; i--){ console.log(i); } console.log("All done!") } # 재귀 함수 예제 2 function sumRange(num){ if(num === 1) return 1; return num + sumRange(num-1); } sumRange(4) # 재귀 함수 예제 3 // Recursive Version function fact..