[数据结构常用算法] BST

说明：operation on binary search tree like add,delete,
<Modraj> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[数据结构常用算法] CPPkuaisupaixu

说明：数组块数排序，用三种方式进行排序，可自己输入数列排序，自动生成数列排序-Sorting an array blocks, with three ways to sort, you can enter the series of their own sort, sort automatically generated series
<刘学北> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] QPSK

说明：存在多径的OPSK传输性能仿真。可以绘出不同信噪比下的误码率曲线图-The OPSK multipath transmission performance simulation. Can draw different SNR BER curves
<PT> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] FEM

说明：用有限差分法求解电机槽电磁场的经典案例，对象为一个闭口槽，激励源为电流密度-Motor using the finite difference method to solve a classic case of slot fields
<Lucy> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] selection_diversity

说明：接收端选择性多样化，用于优化瑞丽信道的衰落，减少误码率-selection diversity
<chen> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] DFP

说明：DFP计算算法(精确一维搜索,花费时间很少) -DFP calculation algorithm (exact one-dimensional search, spent little time)
<赵凡> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] BP-calculated-using-Bayesian-

说明：Matlab BP calculated using Bayesian neural network source code
<alexy> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] FR

说明：无约束优化FR算法的MATLAB实现源代码（不精确一维搜索）-FR algorithm for unconstrained optimization MATLAB implementation source code (inexact one-dimensional search)
<赵凡> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[matlab例程] Untitled2

说明：In this programe a highly scattered enviroment is considered. The Capacity of a MIMO channel with nt transmit antenna and nr recieve antenna is analyzed.capacity of MIMO the result dependences Capacity (bit/s/Hz), and the SNR (dB), in this simulation
<Rafal> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[数值算法/人工智能] doublinklist

说明：Double linked list- a doubly-linked list is a linked data structure that consists of a set of sequentially-linked records called nodes. Each node contains two fields, called links, that are references to the previous and to the next node in the seque
<irisrd> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[数值算法/人工智能] bubble

说明：Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has O(n2) complexity, making it inefficient on large lists, and generally performs worse than the similar insertion sort. Selection sort is noted for its simplicity,
<irisrd> 在 2025-07-15 上传 | 大小：1kb | 下载：0

[数值算法/人工智能] insertion

说明：Insertion sort is a simple sorting algorithm: a comparison sort in which the sorted array (or list) is built one entry at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort
<irisrd> 在 2025-07-15 上传 | 大小：1kb | 下载：0