Data Structure and Algorithm with javascript

-



Data Structure and Algorithm with Javascript

Increase your skills in JavaScript by learning the data structure and algorithm with my best wishes for excellence


prerequirements

  • Javascript
  • Javascript BOM
  • Javascript DOM

تعليقات

إرسال تعليق

المشاركات الشائعة من هذه المدونة

Custom Web Development

-
Web Development services that power your website Our web development team in helping you plan, build and market your web project. What is the difference between Web Design and Web Development? Web development, on the other hand, includes all the programming that takes place on the backend of the website. This includes the coding of all the pages, applications, and functions that will power your website. While many people use these terms interchangeably, there is an important difference. Web design is all about the front-end of the website and creating a great first impression for customers. It is the design of the website, and can include everything from the color scheme and layout to the navigation and content. When does the development phase start? The website development process starts as soon as you approve the web design. Once we understand the goals and requirements of your site, the developers will start coding. We will begin by completing an initial page and ...
قراءة المزيد

Searching Algorithms with javascript

-
Searching Algorithms Linear Search it finds what we are searching for by brute force, making it easy to implement. we will use three different ways in javascript. first way : search with includes method. *example: Array.includes("something"); *includes method will return True or False. second way : search with indexOf method. *example: Array.indexOf("something"); *indexOf method will return number 'the index of the something' third way : search with Find method. *example: Array.find(item => item === "something"); *we write in this method a function and it will return something we search about. Binary Search Binary search only works on sorted arrays.O(log n) 'big o notation'. Example : [1,2,3,4,5,6,7,8,9,10] for example if we search for number 7 we have in this array three things the first thing is the left = 1 and second thing is a right = 10 and last thing is a mid = 5 so we will check the ...
قراءة المزيد