Web Front-end
JS Tutorial
JS implements the simplest search, sorting, and deduplication algorithm
JS implements the simplest search, sorting, and deduplication algorithm
This time I will bring you the simplest search, sorting, and deduplication algorithm implemented in JS. What are the things to pay attention to in JS implementation of search, sorting, and deduplication? The following is a practical case. Let’s take a look. one time. Today I summarized a simple sorting algorithm
[Custom sorting]
First find the smallest number, and then compare this number with other numbers in the array. If you find a number smaller than this number, swap the two numbers, and then continue to find the next smallest number for the next round of comparison
var arr = [31, 6, 19, 8, 2, 3];
function findMin(start, arr) {
var iMin = arr[start];
var iMinIndex = start;
for (var i = start + 1; i < arr.length; i++) {
if (arr[i] < iMin) {
iMin = arr[i];
iMinIndex = i;
}
}
return iMinIndex;
}
function sort1(arr) {
for (var i = 0; i < arr.length; i++) {
var iMinIndex = findMin(i, arr);
var car;
car = arr[i];
arr[i] = arr[iMinIndex];
arr[iMinIndex] = car;
}
return arr;
}
document.write(sort1(arr));[Linear Search]: Search one by one
//不重复 有序
var arr = [0];
for (var i = 1; i < 100000; i++) {
arr[i] = arr[i - 1] + Math.floor(Math.random() * 4 + 1);
}
function find1(n, arr) {
for (var i = 0; i < arr.length; i++) {
if (arr[i] == n) {
return true;
}
}
return false;
}
//测试性能
var t1 = new Date().getTime();
for (var i = 0; i < 10000; i++) {
var n = Math.random() * 10000;
find2(n, 0, arr.length - 1)
}
alert(new Date().getTime() - t1);【
Binary search】: Keep dividing it into two parts. Partial search is a universal method, not necessarily the best, but a guaranteed method. . (Divide and conquer method)
***Add the middle values and divide by two, uniformly left, round down
//不重复 有序
var arr = [12, 17, 23, 34, 45, 76, 89];
function find2(n, s, e) {
//边界处理
if (s > e) {
return false;
} else if (s == e) {
if (arr[s] == n) {
return true;
} else {
return false;
}
}
var c = Math.floor((s + e) / 2);
if (arr[c] == n) {
return true;
} else {
if (n < arr[c]) {
return find2(n, s, c);
} else {
return find2(n, c + 1, e);
}
}
}
alert(find2(34, 0, arr.length - 1)); //true false[Boundary processing]-----Recursion, one level Find one layer down
//要求数组不重复有顺序\
var arr = [12, 23, 34, 45, 56, 67, 78]
function find2(n, s, e) {
if (s > e) {
return fasle;
} else if (s == e) {
if (arr[s] == e) {
return true;
} else {
return false;
}
}
var c = Math.floor((s + e) / 2);
if (arr[c] == n) {
return true;
} else {
if (n < arr[c]) {
return find2(n, s, c);
} else {
return find2(n, c + 1, e);
}
}
}
alert(find2(12, arr.length + 1, 78));Application
【Find minimum value】
var arr = [12, 54, 32, 9, 5, 3, 1, 101, -100, -1000];
function findMin(s, e) {
if (s > e) {
return [];
} else if (s == e) {
return arr[s];
} else if (s == e - 1) {
if (arr[s] < arr[e]) {
return arr[s];
} else {
return arr[e];
}
}
var c = Math.floor((s + e) / 2);
var l = findMin(s, c);
var r = findMin(c + 1, e);
if (l < r) {
return l;
} else {
return r;
}
}
alert(findMin(0, arr.length - 1));【Array deduplication】
var arr = [1, 2, 3, 4, 5, 4, 3, 4, 5, 2, 1, 4, 2, 1, 5, 7];
function findInArr(n, arr) {
for (var i = 0; i < arr.length; i++) {
if (arr[i] == n) {
return true;
}
}
return false;
}
function removeCopy(s, e) {
if (s > e) {
return [];
} else if (s == e) {
return [arr[s]];
} else if (s == e - 1) {
if (arr[s] == arr[e]) {
return [arr[s]];
} else {
return [arr[s], arr[e]]
}
}
var c = Math.floor((s + e) / 2);
var l = removeCopy(s, c);
var r = removeCopy(c + 1, e);
for (var i = 0; i < r.length; i++) {
if (!findInArr(r[i], l)) {
l.push(r[i]);
}
}
return l;
}
document.write(removeCopy(0, arr.length - 1));【
Array sortingBubble sortBubbleSortLoop, take out two values each time and compare them two by two. If the next value is smaller than the current one, then Swap positions
The outer loop is to loop to get the numbers, and the inner loop is to swap the numbers in pairs
var arr = [ - 122, -2, 5, 6, 73, 34, 5, 2];
function BubbleSort(arr) {
for (var i = 0; i < arr.length; i++) {
for (var j = 0; j < arr.length - 1; j++) {
if (arr[j] > arr[j + 1]) {
var tmp = arr[j];
arr[j] = arr[j + 1];
arr[j + 1] = tmp
}
}
}
return arr;
}
document.write(BubbleSort(arr));[Quick Sort] -------quickSort
Get For the number in the middle of the array, place the number smaller than the middle number on the left side of the middle number, and the larger number than the middle number on the right side, and then link the two times together
function quickSort(arr, s, e) {
//边界处理 参与流程
if (arr.length == 0) {
return [];
}
var c = Math.floor((s + e) / 2);
var arrC = arr.splice(c, 1);
var l = [];
var r = [];
for (var i = 0; i < arr.length; i++) {
if (arr[i] < arrC) {
l.push(arr[i]);
} else {
r.push(arr[i]);
}
}
return quickSort(l).concat(arrC, quickSort(r));
}
var arr = [5, 5, 12, 56, 1, 67, -1, -23 - 1];
document.write(quickSort(arr, 0, arr.length - 1));[Hash] hash Hash array ------ Commonly used structures in js
Add
var arr = [];
arr.length = 0;
var cont = 0;
function hash_add(n) {
var pos = n % arr.length;
//当空间不足的时候
if (arr[pos]) {
while (arr[pos]) {
cont++;
if (arr[pos] == n) {
return;
} else {
pos++;
if (pos == arr.length) {
pos = 0;
}
}
}
arr[pos] = n;
} else {
arr[pos] = n;
}
//空间不足的时候的扩建
if (cont == arr.length) {
//d等呗扩建
var oldArr = arr;
arr.length = oldArr.length * 2;
arr = [];
for (var i = 0; i < oldArr.length; i++) {
arr.push(oldArr[i]);
count = 0;
}
}
}
hash_add();I believe you have mastered the method after reading the case in this article. For more exciting information, please pay attention to other related articles on the PHP Chinese website!
Recommended reading:
How to use the Vue-based lazy loading plug-in vue-view-lazy
##How to use jquery toggleClass () attribute to create article paragraphs and change the background color
The above is the detailed content of JS implements the simplest search, sorting, and deduplication algorithm. For more information, please follow other related articles on the PHP Chinese website!
Hot AI Tools
Undresser.AI Undress
AI-powered app for creating realistic nude photos
AI Clothes Remover
Online AI tool for removing clothes from photos.
Undress AI Tool
Undress images for free
Clothoff.io
AI clothes remover
AI Hentai Generator
Generate AI Hentai for free.
Hot Article
Hot Tools
Notepad++7.3.1
Easy-to-use and free code editor
SublimeText3 Chinese version
Chinese version, very easy to use
Zend Studio 13.0.1
Powerful PHP integrated development environment
Dreamweaver CS6
Visual web development tools
SublimeText3 Mac version
God-level code editing software (SublimeText3)
Hot Topics
1376
52
CLIP-BEVFormer: Explicitly supervise the BEVFormer structure to improve long-tail detection performance
Mar 26, 2024 pm 12:41 PM
Written above & the author’s personal understanding: At present, in the entire autonomous driving system, the perception module plays a vital role. The autonomous vehicle driving on the road can only obtain accurate perception results through the perception module. The downstream regulation and control module in the autonomous driving system makes timely and correct judgments and behavioral decisions. Currently, cars with autonomous driving functions are usually equipped with a variety of data information sensors including surround-view camera sensors, lidar sensors, and millimeter-wave radar sensors to collect information in different modalities to achieve accurate perception tasks. The BEV perception algorithm based on pure vision is favored by the industry because of its low hardware cost and easy deployment, and its output results can be easily applied to various downstream tasks.
Implementing Machine Learning Algorithms in C++: Common Challenges and Solutions
Jun 03, 2024 pm 01:25 PM
Common challenges faced by machine learning algorithms in C++ include memory management, multi-threading, performance optimization, and maintainability. Solutions include using smart pointers, modern threading libraries, SIMD instructions and third-party libraries, as well as following coding style guidelines and using automation tools. Practical cases show how to use the Eigen library to implement linear regression algorithms, effectively manage memory and use high-performance matrix operations.
Explore the underlying principles and algorithm selection of the C++sort function
Apr 02, 2024 pm 05:36 PM
The bottom layer of the C++sort function uses merge sort, its complexity is O(nlogn), and provides different sorting algorithm choices, including quick sort, heap sort and stable sort.
Can artificial intelligence predict crime? Explore CrimeGPT's capabilities
Mar 22, 2024 pm 10:10 PM
The convergence of artificial intelligence (AI) and law enforcement opens up new possibilities for crime prevention and detection. The predictive capabilities of artificial intelligence are widely used in systems such as CrimeGPT (Crime Prediction Technology) to predict criminal activities. This article explores the potential of artificial intelligence in crime prediction, its current applications, the challenges it faces, and the possible ethical implications of the technology. Artificial Intelligence and Crime Prediction: The Basics CrimeGPT uses machine learning algorithms to analyze large data sets, identifying patterns that can predict where and when crimes are likely to occur. These data sets include historical crime statistics, demographic information, economic indicators, weather patterns, and more. By identifying trends that human analysts might miss, artificial intelligence can empower law enforcement agencies
Improved detection algorithm: for target detection in high-resolution optical remote sensing images
Jun 06, 2024 pm 12:33 PM
01 Outlook Summary Currently, it is difficult to achieve an appropriate balance between detection efficiency and detection results. We have developed an enhanced YOLOv5 algorithm for target detection in high-resolution optical remote sensing images, using multi-layer feature pyramids, multi-detection head strategies and hybrid attention modules to improve the effect of the target detection network in optical remote sensing images. According to the SIMD data set, the mAP of the new algorithm is 2.2% better than YOLOv5 and 8.48% better than YOLOX, achieving a better balance between detection results and speed. 02 Background & Motivation With the rapid development of remote sensing technology, high-resolution optical remote sensing images have been used to describe many objects on the earth’s surface, including aircraft, cars, buildings, etc. Object detection in the interpretation of remote sensing images
Simple JavaScript Tutorial: How to Get HTTP Status Code
Jan 05, 2024 pm 06:08 PM
JavaScript tutorial: How to get HTTP status code, specific code examples are required. Preface: In web development, data interaction with the server is often involved. When communicating with the server, we often need to obtain the returned HTTP status code to determine whether the operation is successful, and perform corresponding processing based on different status codes. This article will teach you how to use JavaScript to obtain HTTP status codes and provide some practical code examples. Using XMLHttpRequest
Application of algorithms in the construction of 58 portrait platform
May 09, 2024 am 09:01 AM
1. Background of the Construction of 58 Portraits Platform First of all, I would like to share with you the background of the construction of the 58 Portrait Platform. 1. The traditional thinking of the traditional profiling platform is no longer enough. Building a user profiling platform relies on data warehouse modeling capabilities to integrate data from multiple business lines to build accurate user portraits; it also requires data mining to understand user behavior, interests and needs, and provide algorithms. side capabilities; finally, it also needs to have data platform capabilities to efficiently store, query and share user profile data and provide profile services. The main difference between a self-built business profiling platform and a middle-office profiling platform is that the self-built profiling platform serves a single business line and can be customized on demand; the mid-office platform serves multiple business lines, has complex modeling, and provides more general capabilities. 2.58 User portraits of the background of Zhongtai portrait construction
Add SOTA in real time and skyrocket! FastOcc: Faster inference and deployment-friendly Occ algorithm is here!
Mar 14, 2024 pm 11:50 PM
Written above & The author’s personal understanding is that in the autonomous driving system, the perception task is a crucial component of the entire autonomous driving system. The main goal of the perception task is to enable autonomous vehicles to understand and perceive surrounding environmental elements, such as vehicles driving on the road, pedestrians on the roadside, obstacles encountered during driving, traffic signs on the road, etc., thereby helping downstream modules Make correct and reasonable decisions and actions. A vehicle with self-driving capabilities is usually equipped with different types of information collection sensors, such as surround-view camera sensors, lidar sensors, millimeter-wave radar sensors, etc., to ensure that the self-driving vehicle can accurately perceive and understand surrounding environment elements. , enabling autonomous vehicles to make correct decisions during autonomous driving. Head
