c: Sorting Algorithms

SortAlgorithm.h

/*****************************************************************//*** \file   SortAlgorithm.h* \brief  业务操作方法* VSCODE   c11  https://github.com/hustcc/JS-Sorting-Algorithm/blob/master/2.selectionSort.md* https://www.programiz.com/dsa/counting-sort* https://www.geeksforgeeks.org/sorting-algorithms/* \author geovindu,Geovin Du* \date   2023-09-19
***********************************************************************/
#ifndef SORTALGORITHM_H
#define SORTALGORITHM_H#include <stdio.h>
#include <stdlib.h>/*** @brief 1。Bubble Sort冒泡排序法* @param data    INT 数组* @param lensize   数组长度** @return 排序好的数组*   *   */
int* BubbleSort(int* arrdata,int lensize);/*** @brief 2 C Program for Selection Sort 选择排序* @param arrdata    INT 数组int arrdata[]* @param lensize   数组长度** @return 返回说明*    *    */
void SelectionSort(int* arrdata, int lensize);/*** @brief 3 Insertion Sort插入排序* @param arrdata    INT 数组int arrdata[]* @param lensize   数组长度** @return 返回说明*   *   */void InsertionSort(int* arrdata, int lensize);/*** @brief 4 Quick Sort 快速排序* @param arrdata    INT 数组* @param start   数组长度开始值* @param end     数组长度结束值* @return 返回说明*   *   */
void QuickSort(int* arrdata, int start, int end);/*** @brief 5 Merge Sort 合并排序* @param arrdata    INT 数组* @param start   数组长度开始值* @param end     数组长度结束值* @return 返回说明*   *    */
void MergeSort(int* arrdata, int const begin, int const end);/*** @brief 6 Counting Sort 计数排序* @param arrdata    INT 数组* @param lensize   数组长度* @return 返回说明*    *    */
void CountingSort(int* arrdata, int lensize);/*** @brief 7 Radix Sort 基数排序* @param arrdata    INT 数组* @param lensize     数组长度* @return 返回说明*   *   */
void Radixsort(int* arrdata, int lensize);/*** @brief 8 Bucket Sort 桶排序* @param arrdata    INT 数组* @return 返回说明*   *   */
void BucketSort(int* arrdata);/*** @brief 9 Heap Sort 堆排序* @param arrdata    INT 数组* @return 返回说明*    *    */
void HeapSort(int* arrdata, int lensize);/*** @brief 10 Shell Sort 希尔排序* @param arrdata    INT 数组* @param lensize 数组长度* @return 返回说明*    *    */
void ShellSort(int* arrdata, int lensize);#endif //SORTALGORITHM_H

SortAlgorithm.c

/*****************************************************************//*** \file   SortAlgorithm.c* \brief  c Sorting Algorithms 业务操作方法* VSCODE   c11  https://stackoverflow.com/questions/71924077/configuring-task-json-and-launch-json-for-c-in-vs-code* https://www.programiz.com/dsa/counting-sort* https://www.geeksforgeeks.org/sorting-algorithms/* 安装插件“Doxygen Documentation Generator”,用来生成注释。* 安装插件”C/C++ Snippets”,用来生成文件头、代码块分割线等。* \author geovindu,Geovin Du* \date   2023-09-19
***********************************************************************/#include <stdio.h>
#include <stdlib.h>#define MAXSIZE 100/*** @brief 1。Bubble Sort冒泡排序法* @param arrdata    INT 数组* @param lensize   数组长度** @return 排序好的数组*    *    */
int* BubbleSort(int* arrdata,int lensize)
{int i,j,tmp;int* newdate;/* 原始数据 *///int lensize=sizeof(data) / sizeof(data [0]);//sizeof(data); //sizeof(data) / sizeof(data[0]);//printf("2共 長度是:%d ",lensize);printf("冒泡排序法:\n原始数据为:");for (i=0;i<lensize;i++)printf("%3d",arrdata[i]);printf("\n");for (i=(lensize-1);i>=0;i--)     /* 扫描次数 */{for (j=0;j<i;j++)/*比较、交换次数*/{if (arrdata[j]>arrdata[j+1])   /* 比较相邻两数,如第一个数较大则交换 */{tmp=arrdata[j];arrdata[j]=arrdata[j+1];arrdata[j+1]=tmp;}}printf("第 %d 次排序后的结果是:",lensize-i); /*把各次扫描后的结果打印出来*/for (j=0;j<lensize;j++)printf("%3d",arrdata[j]);printf("\n");}//printf("最终排序的结果为:");for (i=0;i<lensize;i++)//newdate[i]=data[i];printf("%3d",arrdata[i]);printf("\n");return arrdata;}void swap(int *a,int *b) //交換兩個變數
{int temp = *a;*a = *b;*b = temp;
}/*** @brief 2 C Program for Selection Sort 选择排序* @param arrdata    INT 数组* @param size   数组长度** @return 返回说明*     -<em>false</em> fail*     -<em>true</em> succeedS*/
void SelectionSort(int* arrdata, int len)
{int i,j;for (i = 0 ; i < len - 1 ; i++){int min = i;for (j = i + 1; j < len; j++)     //走訪未排序的元素if (arrdata[j] < arrdata[min])    //找到目前最小值min = j;    //紀錄最小值swap(&arrdata[min], &arrdata[i]);    //做交換}}/*** @brief 3 Insertion Sort插入排序* @param arrdata    INT 数组int arrdata[]* @param size   数组长度** @return 返回说明*   *    */void InsertionSort(int* arrdata, int size){// defining some iterables and variablesint i, temp, j;// using the for-loopfor (i = 1; i < size; i++){// initializing the temp variable as value at index i from arraytemp = arrdata[i];// initializing another iterable valuej = i - 1;// using the while loop for j >= 0 and arr[j] > tempwhile (j >= 0 && arrdata[j] > temp){// swapping the elementsarrdata[j + 1] = arrdata[j];j = j - 1;}arrdata[j + 1] = temp;}
}void qswap(int* a, int* b)
{int t = *a;*a = *b;*b = t;
}int partition(int arrdata[], int low, int high)
{// Choosing the pivotint pivot = arrdata[high];// Index of smaller element and indicates// the right position of pivot found so farint qi = (low - 1);for (int j = low; j <= high - 1; j++) {// If current element is smaller than the pivotif (arrdata[j] < pivot) {           qi++;qswap(&arrdata[qi], &arrdata[j]);}}qswap(&arrdata[qi + 1], &arrdata[high]);return (qi + 1);
}/*** @brief 4 Quick Sort 快速排序* @param arrdata    INT 数组int arrdata[]* @param low   数组长度开始值* @param high     数组长度结束值* @return 返回说明*   *   */
void QuickSort(int* arrdata, int low, int high){if (low < high) {// pi is partitioning index, arr[p]// is now at right placeint pi = partition(arrdata, low, high);// Separately sort elements before// partition and after partitionQuickSort(arrdata, low, pi - 1);QuickSort(arrdata, pi + 1, high);}
}void merge(int array[], int const left, int const mid,int const right)
{int const subArrayOne = mid - left + 1;int const subArrayTwo = right - mid;// Create temp arraysint* leftArray =(int*)malloc(subArrayOne);// int [subArrayOne];int* rightArray = (int*)malloc(subArrayTwo);//int [subArrayTwo];// Copy data to temp arrays leftArray[] and rightArray[]for (int i = 0; i < subArrayOne; i++)leftArray[i] = array[left + i];for (int j = 0; j < subArrayTwo; j++)rightArray[j] = array[mid + 1 + j];int indexOfSubArrayOne = 0;int indexOfSubArrayTwo = 0;int indexOfMergedArray = left;// Merge the temp arrays back into array[left..right]while (indexOfSubArrayOne < subArrayOne&& indexOfSubArrayTwo < subArrayTwo) {if (leftArray[indexOfSubArrayOne]<= rightArray[indexOfSubArrayTwo]) {array[indexOfMergedArray]= leftArray[indexOfSubArrayOne];indexOfSubArrayOne++;}else {array[indexOfMergedArray]= rightArray[indexOfSubArrayTwo];indexOfSubArrayTwo++;}indexOfMergedArray++;}// Copy the remaining elements of// left[], if there are anywhile (indexOfSubArrayOne < subArrayOne) {array[indexOfMergedArray]= leftArray[indexOfSubArrayOne];indexOfSubArrayOne++;indexOfMergedArray++;}// Copy the remaining elements of// right[], if there are anywhile (indexOfSubArrayTwo < subArrayTwo) {array[indexOfMergedArray]= rightArray[indexOfSubArrayTwo];indexOfSubArrayTwo++;indexOfMergedArray++;}//delete[] leftArray;//delete[] rightArray;
}/*** @brief 5 Merge Sort 合并/归并排序* @param arrdata    INT 数组* @param start   数组长度开始值* @param end     数组长度结束值* @return 返回说明*    *    */
void MergeSort(int* arrdata, int const begin, int const end)
{if (begin >= end)return;int mid = begin + (end - begin) / 2;MergeSort(arrdata, begin, mid);MergeSort(arrdata, mid + 1, end);merge(arrdata, begin, mid, end);
}/*** @brief 6 Counting Sort 计数排序* @param arrdata    INT 数组* @param size   数组长度* @return 返回说明*    *    */
void CountingSort(int* arrdata, int size) {int output[10];// Find the largest element of the arrayint max = arrdata[0];for (int i = 1; i < size; i++) {if (arrdata[i] > max)max = arrdata[i];}// The size of count must be at least (max+1) but// we cannot declare it as int count(max+1) in C as// it does not support dynamic memory allocation.// So, its size is provided statically.int count[10];// Initialize count array with all zeros.for (int i = 0; i <= max; ++i) {count[i] = 0;}// Store the count of each elementfor (int i = 0; i < size; i++) {count[arrdata[i]]++;}// Store the cummulative count of each arrayfor (int i = 1; i <= max; i++) {count[i] += count[i - 1];}// Find the index of each element of the original array in count array, and// place the elements in output arrayfor (int i = size - 1; i >= 0; i--) {output[count[arrdata[i]] - 1] = arrdata[i];count[arrdata[i]]--;}// Copy the sorted elements into original arrayfor (int i = 0; i < size; i++) {arrdata[i] = output[i];}
}int getMax(int array[], int n) {int max = array[0];for (int i = 1; i < n; i++)if (array[i] > max)max = array[i];return max;
}void radcountingSort(int array[], int size, int place) {int output[size + 1];int max = (array[0] / place) % 10;for (int i = 1; i < size; i++) {if (((array[i] / place) % 10) > max)max = array[i];}int count[max + 1];for (int i = 0; i < max; ++i)count[i] = 0;// Calculate count of elementsfor (int i = 0; i < size; i++)count[(array[i] / place) % 10]++;// Calculate cumulative countfor (int i = 1; i < 10; i++)count[i] += count[i - 1];// Place the elements in sorted orderfor (int i = size - 1; i >= 0; i--) {output[count[(array[i] / place) % 10] - 1] = array[i];count[(array[i] / place) % 10]--;}for (int i = 0; i < size; i++)array[i] = output[i];
}/*** @brief 7 Radix Sort 基数排序* @param arrdata    INT 数组* @param size   数组长度* @return 返回说明*    *   */
void Radixsort(int* arrdata, int size) {// Get maximum elementint max = getMax(arrdata, size);// Apply counting sort to sort elements based on place value.for (int place = 1; max / place > 0; place *= 10)radcountingSort(arrdata, size, place);
}//这个数是有规则的
#define NARRAY 9   // Array size 7
#define NBUCKET 8  // Number of buckets  6
#define INTERVAL 12  // Each bucket capacity  10struct Node {int data;struct Node *next;
};struct Node *BucketInsertionSort(struct Node *list);
//void printBuckets(struct Node *list);int getBucketIndex(int value);/*** @brief 8 Radix Sort 基数排序* @param arrdata    INT 数组* @return 返回说明*     -<em>false</em> fail*     -<em>true</em> succeed*/
void BucketSort(int* arrdata) {int i, j;struct Node **buckets;// Create buckets and allocate memory sizebuckets = (struct Node **)malloc(sizeof(struct Node *) * NBUCKET);// Initialize empty bucketsfor (i = 0; i < NBUCKET; ++i) {buckets[i] = NULL;}// Fill the buckets with respective elementsfor (i = 0; i < NARRAY; ++i) {struct Node *current;int pos = getBucketIndex(arrdata[i]);current = (struct Node *)malloc(sizeof(struct Node));current->data = arrdata[i];current->next = buckets[pos];buckets[pos] = current;}// Print the buckets along with their elements//for (i = 0; i < NBUCKET; i++) {//printf("Bucket[%d]: ", i);//printBuckets(buckets[i]);//printf("\n");//}// Sort the elements of each bucketfor (i = 0; i < NBUCKET; ++i) {buckets[i] = BucketInsertionSort(buckets[i]);}//printf("-------------\n");//printf("Bucktets after sorting\n");// for (i = 0; i < NBUCKET; i++) {//printf("Bucket[%d]: ", i);//printBuckets(buckets[i]);//printf("\n");// }// Put sorted elements on arrfor (j = 0, i = 0; i < NBUCKET; ++i) {struct Node *node;node = buckets[i];while (node) {arrdata[j++] = node->data;node = node->next;}}return;
}struct Node* BucketInsertionSort(struct Node *list) {struct Node *k, *nodeList;if (list == 0 || list->next == 0) {return list;}nodeList = list;k = list->next;nodeList->next = 0;while (k != 0) {struct Node *ptr;if (nodeList->data > k->data) {struct Node *tmp;tmp = k;k = k->next;tmp->next = nodeList;nodeList = tmp;continue;}for (ptr = nodeList; ptr->next != 0; ptr = ptr->next) {if (ptr->next->data > k->data)break;}if (ptr->next != 0) {struct Node *tmp;tmp = k;k = k->next;tmp->next = ptr->next;ptr->next = tmp;continue;} else {ptr->next = k;k = k->next;ptr->next->next = 0;continue;}}return nodeList;
}int getBucketIndex(int value) {return value / INTERVAL;
}void printBuckets(struct Node *list) {struct Node *cur = list;while (cur) {printf("%d ", cur->data);cur = cur->next;}
}void heapify(int arr[], int n, int i) {// Find largest among root, left child and right childint largest = i;int left = 2 * i + 1;int right = 2 * i + 2;if (left < n && arr[left] > arr[largest])largest = left;if (right < n && arr[right] > arr[largest])largest = right;// Swap and continue heapifying if root is not largestif (largest != i) {swap(&arr[i], &arr[largest]);heapify(arr, n, largest);}}/*** @brief 9 Heap Sort 堆排序* @param arrdata    INT 数组* @return 返回说明*   *   */
void HeapSort(int* arrdata, int n) {// Build max heapfor (int i = n / 2 - 1; i >= 0; i--)heapify(arrdata, n, i);// Heap sortfor (int i = n - 1; i >= 0; i--) {swap(&arrdata[0], &arrdata[i]);// Heapify root element to get highest element at root againheapify(arrdata, i, 0);}
}/*** @brief 10 Shell Sort 希尔排序* @param arrdata    INT 数组* @param n 数组长度* @return 返回说明*   *    */
void ShellSort(int* arrdata, int n) {// Rearrange elements at each n/2, n/4, n/8, ... intervalsfor (int gap = n/2; gap > 0; gap /= 2){// Do a gapped insertion sort for this gap size.// The first gap elements a[0..gap-1] are already in gapped order// keep adding one more element until the entire array is// gap sortedfor (int i = gap; i < n; i += 1){// add a[i] to the elements that have been gap sorted// save a[i] in temp and make a hole at position iint temp = arrdata[i];// shift earlier gap-sorted elements up until the correct// location for a[i] is foundint j;          for (j = i; j >= gap && arrdata[j - gap] > temp; j -= gap)arrdata[j] = arrdata[j - gap];//  put temp (the original a[i]) in its correct locationarrdata[j] = temp;}}/*for (int interval = n / 2; interval > 0; interval /= 2) {for (int i = interval; i < n; i += 1) {int temp = array[i];int j;for (j = i; j >= interval && array[j - interval] > temp; j -= interval) {array[j] = array[j - interval];}array[j] = temp;}}*/
}

调用:

/** @Author: 涂聚文 geovindu,Geovin Du* @Date: 2023-09-11 14:07:29* @LastEditors:* @LastEditTime: 2023-09-20 14:35:49* @FilePath: \testcpp\helloword.c* @Description:*/
/*****************************************************************//*** \file   helloworld.C* \brief  业务操作方法* VSCODE   c11         安装插件“Doxygen Documentation Generator”,用来生成注释。安装插件”C/C++ Snippets”,用来生成文件头、代码块分割线等。KoroFileHeaderC/C++ Snippets插件设置* \author geovindu,Geovin Du* \date   2023-09-19
***********************************************************************/#include<string.h>
#include<stdio.h>
#include<stdlib.h>
#include "include/SortAlgorithm.h"int main()
{printf("hello world, c \n");printf("你好,中国\n");int i;int *p;  char str[20];//1冒泡排序int data[12]={60,50,39,27,12,8,45,63,20,2,10,88};   /* 原始数据 */int lensize=sizeof(data) / sizeof(data [0]);//sizeof(data);p=BubbleSort(data,lensize);//itoa(lensize, str, 10);//printf("1共長度是 %d ",lensize);printf("\n1冒泡排序的结果为:");for (i=0;i<lensize;i++)printf("%3d",p[i]);printf("\n");//2选择排序int arr[] = { 64, 25, 12, 22, 11,88,28,100 };int n = sizeof(arr) / sizeof(arr[0]);selectionSort(arr, n);int ii;printf("2选择排序结果为:");for(ii = 0; ii < n; ii++)printf("%d ", arr[ii]);printf("\n");//3插入排序int inarr[] = {25, 23, 28, 16, 18,100,8,99}; // calculating the size of array int size = sizeof(inarr) / sizeof(inarr[0]); printf("3插入排序结果为:");InsertionSort(inarr, size); for(ii = 0; ii < n; ii++)printf("%d ", inarr[ii]);printf("\n");//4快速排序// defining and initializing an array int qsarr[] = {100,25, 23, 28, 16, 18,8,99,3,20};printf("4快速排序结果为:");// calculating the size of array size = sizeof(qsarr) / sizeof(qsarr[0]); QuickSort(qsarr, 0, size - 1); for (int i = 0; i < size; i++)printf("%d ", qsarr[i]);printf("\n");//5 合并排序printf("5合并排序结果为:");int mearr[] = { 12, 11, 23, 55, 6, 57,3,100,9 };int arr_size = sizeof(mearr) / sizeof(mearr[0]);MergeSort(mearr, 0, arr_size - 1);for (int i = 0; i < arr_size; i++)printf("%d ", mearr[i]);printf("\n");//6 计数排序printf("6计数排序结果为:");int carray[] = {4, 2, 2, 8, 3, 3, 1};int cn = sizeof(carray) / sizeof(carray[0]);CountingSort(carray, cn);for (int i = 0; i < cn; i++)printf("%d ", carray[i]);printf("\n");//7. 基数排序printf("7基数排序结果为:");int rarray[] = {121, 432, 564, 23, 1, 45, 788};int rn = sizeof(rarray) / sizeof(rarray[0]);Radixsort(rarray, rn);for (int i = 0; i < rn; i++)printf("%d ", rarray[i]);printf("\n");//8 Bucket Sort 桶排序printf("8桶排序结果为:");int barray[] = {42, 32, 33, 5,52, 37,100, 47, 51};BucketSort(barray);int bn = sizeof(barray) / sizeof(barray[0]);for (int i = 0; i < bn; i++)printf("%d ", barray[i]);printf("\n");//9堆排序printf("9堆排序结果为:");int harr[] = {1, 12, 9, 5, 6, 10};int hn = sizeof(harr) / sizeof(harr[0]); HeapSort(harr, hn);for (int i = 0; i < hn; i++)printf("%d ", harr[i]);printf("\n");//10.希尔排序printf("10.希尔排序结果为:");int sdata[] = {9, 8, 3, 7, 25, 6, 4, 11,38};int ssize = sizeof(sdata) / sizeof(sdata[0]);ShellSort(sdata, ssize);for (int i = 0; i < ssize; i++)printf("%d ", sdata[i]);printf("\n");//system("pause");  liunx 无效,win 下使用return 0;}

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.rhkb.cn/news/138375.html

如若内容造成侵权/违法违规/事实不符,请联系长河编程网进行投诉反馈email:809451989@qq.com,一经查实,立即删除!

相关文章

PyTorch深度学习(七)【循环神经网络-提高】

数据集文末分享。 模型&#xff1a; 做完padding之后&#xff0c;就可以转换为张量了。 bidirectional是是否使用双向RNN: 输出隐层两个&#xff1a; 代码&#xff1a; import csvimport timeimport matplotlib.pyplot as pltimport numpy as npimport mathimport gzip # 用…

29.CSS边框动画特效

效果 源码 index.html <!DOCTYPE html> <html> <head> <title>Quick CSS Border Trick</title> <link rel="stylesheet" type="text/css" href="style.css"> </head> <body><div class=&q…

three.js——辅助器AxesHelper和轨道控制器OrbitControls的使用

辅助器AxesHelper和轨道控制器OrbitControls的使用 前言效果图1、辅助器AxesHelper:是物体出现辅助的x/y/z轴2、轨道控制器OrbitControls2.1导入OrbitControls文件2.2 使用2.3 如果OrbitControls改变了相机参数&#xff0c;重新调用渲染器渲染三维场景 前言 1、AxesHelper 官网…

网站整站优化-网站整站优化工具

您是否曾为您的网站在搜索引擎中的排名而感到焦虑&#xff1f;是否苦苦思考如何提高流量、吸引更多用户&#xff1f; 什么是整站优化。简而言之&#xff0c;它是一项用于提升网站在搜索引擎中排名的策略和技巧。通过对网站的内容、结构、速度等方面进行优化&#xff0c;可以使…

WPF 类库 使用handycontrol 配置

在学习wpf发现了一个非常好用的UI库 handycontrol 但是很多地方讲的都是WPF应用程序怎么用&#xff0c;很少有讲类库那么引用的问题&#xff0c;所以在这里自己总结一下&#xff0c;希望能帮助到大家&#xff1a; 1.添加 handycontrol 的引用&#xff1b;安装&#xff0c;我已…

[python 刷题] 167 Two Sum II - Input Array Is Sorted 15 3Sum

[python 刷题] 167 Two Sum II - Input Array Is Sorted & 15 3Sum 虽然 3 sum 出来的比较早&#xff0c;不过按照解法来说&#xff0c;2 sum II 算是 3 sum 的前置解法 167 Two Sum II - Input Array Is Sorted 题目&#xff1a; Given a 1-indexed array of integers …

Python中TensorFlow的长短期记忆神经网络(LSTM)、指数移动平均法预测股票市场和可视化...

原文链接&#xff1a;http://tecdat.cn/?p23689 本文探索Python中的长短期记忆&#xff08;LSTM&#xff09;网络&#xff0c;以及如何使用它们来进行股市预测&#xff08;点击文末“阅读原文”获取完整代码数据&#xff09;。 相关视频 在本文中&#xff0c;你将看到如何使用…

使用 FHE 实现加密大语言模型

近来&#xff0c;大语言模型 (LLM) 已被证明是提高编程、内容生成、文本分析、网络搜索及远程学习等诸多领域生产力的可靠工具。 大语言模型对用户隐私的影响 尽管 LLM 很有吸引力&#xff0c;但如何保护好 输入给这些模型的用户查询中的隐私 这一问题仍然存在。一方面&#xf…

【计算机网络】图解路由器(一)

图解路由器&#xff08;一&#xff09; 1、什么是路由器&#xff1f;2、什么是路由选择&#xff1f;3、什么是转发&#xff1f;4、路由器设备有哪些类型&#xff1f;5、根据性能分类&#xff0c;路由器有哪些类型&#xff1f;5.1 高端路由器5.2 中端路由器5.3 低端路由器 6、什…

Linux 安装 git

一 . 安装git 方式1&#xff1a;通过yum 安装 yum -y install git查看是否安装成功 git --version安装目录在&#xff1a;/usr/libexec/git-core yum 安装有一些缺点 &#xff1a;不能自己指定安装目录、安装版本 方式 2 下载tar.gz 包 配置 查看git 版本&#xff1a;Index…

电子器件系列57:肖特基二极管(BAS7005)

什么是肖特基二极管&#xff1f;肖特基二极管工作原理详解&#xff0c;几分钟带你搞定 - 知乎 这几个参数都是二极管很常见的参数&#xff1a;基本上就是正向导通时的极限电流电压&#xff0c;反向截止时的极限电流电压。功耗、温度、结电容&#xff0c;差不多就这些&#xff0…

WebGL HUD(平视显示器)

目录 HUD&#xff08;平视显示器&#xff09; 如何实现HUD 示例程序&#xff08;HUD.html&#xff09; 示例程序&#xff08;HUD.js&#xff09; 代码详解 在网页文字上方显示三维物体 代码详解 HUD&#xff08;平视显示器&#xff09; 平视显示器&#xff08;head…

Postman 的使用教程(详细)

Postman 使用教程 1. 是什么 Postman 是一个接口测试工具软件&#xff0c;可以帮助开发人员管理测试接口。 官网&#xff1a;https://www.getpostman.com/ 2. 安装 建议通过官网下载安装&#xff0c;不要去那些乱七八糟的下载平台&#xff0c;或者留言获取 官网下载地址&am…

package中添加一条命令,用来自动选择包管理器进行依赖安装

package中添加一条命令,用来自动选择包管理器进行依赖安装 前提: 当前项目为vite项目,所以直接使用import导入模块 package.json中的scripts添加 "scripts": {"start": "node scripts/init.js"...},文件目录为 init.js的文件为 import { e…

antd-design-vue Table组件全局配置(分页器...)

描述&#xff1a;该框架许多默认配置好像还不支持&#xff0c;一般都是挨个使用挨个配置。我的项目中也遇到了类似的情况&#xff0c;但是当需求发生变化时&#xff0c;代码所有的组件使用则都需要修改&#xff0c;这种方式真的很不礼貌。 《我为了一口醋包了顿饺子》 需求是将…

Canal 实现MySQL与Elasticsearch7数据同步

1 工作原理 canal 模拟 MySQL slave 的交互协议&#xff0c;伪装自己为 MySQL slave &#xff0c;向 MySQL master 发送 dump协议 MySQL master 收到 dump 请求&#xff0c;开始推送 binary log 给 slave (即 canal ) canal 解析 binary log 对象(原始为 byte 流) 优点&…

tensorflow基础

windows安装tensorflow anaconda或者pip安装tensorflow&#xff0c;tensorflow只支持win7 64系统&#xff0c;本人使用tensorflow1.5版本&#xff08;pip install tensorflow1.5&#xff09; tensorboard tensorboard只支持chrome浏览器&#xff0c;而且加载过程中可能有一段…

计算机竞赛 深度学习+opencv+python实现车道线检测 - 自动驾驶

文章目录 0 前言1 课题背景2 实现效果3 卷积神经网络3.1卷积层3.2 池化层3.3 激活函数&#xff1a;3.4 全连接层3.5 使用tensorflow中keras模块实现卷积神经网络 4 YOLOV56 数据集处理7 模型训练8 最后 0 前言 &#x1f525; 优质竞赛项目系列&#xff0c;今天要分享的是 &am…

jmeter学习文档

JMeter学习&#xff08;一&#xff09;工具简单介绍 一、JMeter 介绍 Apache JMeter是100%纯JAVA桌面应用程序&#xff0c;被设计为用于测试客户端/服务端结构的软件(例如web应用程序)。它可以用来测试静态和动态资源的性能&#xff0c;例如&#xff1a;静态文件&#xff0c;J…

BaseMapper 中的方法

BaseMapper 中的方法&#xff1a; 插入 int insert(T entity) - 插入一条记录。 删除 int deleteById(Serializable id) - 根据主键ID删除记录。 int deleteById(T entity) - 根据实体对象&#xff08;ID&#xff09;删除记录。 int deleteByMap(Map<String, Object> …