Mathfuns vs CLRS.Helper[Lite]

Mathfuns aims at solving mathematical problems in all stages from primary school, junior high school, senior high school to university. It uses its unique computing engine to provide problem-solving services for teachers, students and engineers.You only need to input the formula to get what you want: answer, drawing, association description and analysis, etc.Mathfuns is committed to the simplification of complex mathematical problems to make mathematics easier. Mathfuns is a new universal super calculator. Mathfuns = Formula editor + Graphing calculator + Super calculator + Step solver + Geometric sketchpad. Function highlights ● Powerful formula editing ability ● Standard, scientific and profession computation modes ● Unique computing engine, supporting a variety of computing types ● Typical mathematical problems, a variety of problem-solving methods and detailed steps ● Interactive plotting (2d, 3d) ● Function image and property analysis ● Geometry and analysis ● Support hardware keyboard Calculation type ●Algebra: Real number, complex number, constant, power, exponent, logarithm, factorial, polynomial, trigonometric function, hyperbolic function, summation, product ●Set: Inclusion, subset, proper subset, intersection, union ●Matrix: Determinant, rank, inverse, transpose, conjugate, decomposition, eigenvalue, eigenvector ●Calculus: Limit, derivative, partial derivative, integral, multiple integral ●Equation: Algebraic equation, inequality equation, trigonometric equation, ordinary differential equation, partial differential equation ●Vector: Dot, cross ●Statistics: Maximum, minimum, average, standard deviation, variance, die, binomial distribution, poisson distribution, uniform distribution, exponential distribution, normal distribution, chi square distribution, t distribution, F distribution ●Plot: Points, polylines, functions, parametric equations, implicit functions, polar equations ●Plane geometry: Point, segment, line, circle, ellipse, triangle, polygon ●Space geometry: Point, line, plane Geometric sketchpad ●Basic operation: Select,pan,delete,clear ●Point,midPoint,split ●Segment,fixed length line,ray,vector,polyline, perpendicular line,perpendicular bisector,parallel line,equal vector,angle bisector,tangent line,polar line ● Polygon,regular polygon ●Circle,circular arc, sector ●Measure: Coordinate,equation,length,distance,angle,slope,perimeter,area,radius,arc Length More types, more surprises, looking forward to your exploration! When confirming the purchase, payment will be charged from your Apple ID account. Unless cancelled at least 24 hours before the end of the current period, the subscription will automatically renew. Your account will receive a renewal fee within 24 hours before the end of the current period. You can go to the account settings on the App Store to manage and unsubscribe after purchasing. The discounts and prices are subject to change without prior notice. Term of service https://mathfuns.com/servagree Privacy Policy https://mathfuns.com/policy Contact us Website: www.mathfuns.com Mailbox: mathfuns@hotmail.com QQ Group: 554100855 Sina Weibo: Mathfuns

Refer to The third edition of the book, covering content [need full version]: 2. Getting Started: Insertion sort, Merge sort; 4. Divide-and-Conquer: Maximum-subarray, Matrix Multiplication[normal, recursive, Strassen’s algorithm]; 6. Heapsort: Heapsort[max-heap, min-heap]; 7. Quicksort: Quicksort; 8. Sorting in Linear Time: Counting sort; 12. Binary Search Trees: Binary search tree[Inorder Walk, Search Recursive, Search Iterative, Minimum Iterative, Maximum Iterative, Successor, Predecessor, Insert, Delete]; 13. Red-Black Trees: Red Black Tree[Insert, Delete]; 15. Dynamic Programming: Rod cutting[Recursive, Top_down, Bottom_up, Print],Longest common subsequence; 16. Greedy Algorithms: Acitivity selection[Recursive, Iterative],Huffman codes; 22. Elementary Graph: Breadth-first search, Depth-first search, Topological sort, Strongly connected components; 23. Minimum Spanning Trees: Minimum spanning tree[Kruskal’s algorithm，Prim’s algorithm]; 24. Single-Source Shortest Paths: The Bellman-Ford algorithm，DAG algorithm，Dijkstra’s algorithm; 25. All-pairs Shortest Paths: All-pairs Shortest paths algorithms[Slow，Faster，The Floyd-Warshall algorithm]; 26. Maximum Flow: The Ford-Fulkerson algorithm; Addition: Tower of Hanoi，N Queens Problem，Comparison of sorting algorithms; The primary features: You can run the pseudo-code single step or continuous, observe the change of parameters and data structures，it can help you to understand the design thought of the algorithm; You can set breakpoints in program and ovserve the status of breakpoint, it can help you to understand why this algorithm is corrcet by using loop invariants; With running-time function stacks and the returning positions，you can track the running process of recursive functions easily, and understand the operation mechanism of computer programs; By recording the performed times of the pseudo-codes can help you to understand the running time of algorithms; I wish this app can be helpful to you;