## Recursive Divide--Example 4. Quick sorting

Recursive Dividing - Example 4. Quick Sorting
1. Description of the problem
Given an array, use the quick sort algorithm to sort.
2. Solving problems
Familiar QuickRow, written several times before. RandomizedQuickSort, an algorithm for random pivot selection, is also extended here. The idea of Quick Row is simple: For input a[p:r], sort ...

Posted on *Tue, 30 Nov 2021 14:11:50 -0500* by **harley1387**

## Algorithm analysis and design "two" recursive algorithm

1, Recursive thought
Recursion is the most commonly used method in algorithm design. It usually makes the description and solution of a large and complex problem concise and clear.
What is recursion?
In short, a function call itself is recursive. If you want n! Recursive implementation function of:
int Factorial(int n)
{
if (n == 0)
...

Posted on *Sun, 28 Nov 2021 15:33:54 -0500* by **ferrit91**

## LeetCode_String_394. String Decode String [String, Recursive] [java] [Medium]

Catalog
1. Title Description
English Description
Chinese Description
Examples and instructions
2. Solving problems
Three, AC code
Java
4. Problem solving process
First Bo
Second Stroke
1. Title Description
English Description
Given an encoded string, return its decoded string.
The encoding rule is: k[encoded_string], where ...

Posted on *Sat, 27 Nov 2021 13:55:22 -0500* by **DragonFire-N[R]**

## Internet classic algorithm interview question - Verifying binary search tree

preface
Hello, I'm brother Xiong. Today, I bring you a high-frequency interview question related to binary tree. This question has been used as an interview question by big companies such as Google, byte, Microsoft and Amazon in half a year, that is, the 98th question on force buckle - Verifying binary search tree.
This paper mainly introduce ...

Posted on *Wed, 24 Nov 2021 14:29:24 -0500* by **CFennell**

## Little knowledge of C language --- the use of recursive functions

C language allows functions to call themselves, which is called recursion. When many people first learn recursion, they are often confused by layers of nested calls. They don't know how to call them? Now let's use a small example to demonstrate how the function works when it is called recursively.
void up_and_down(int n)
{
printf("---- ...

Posted on *Fri, 01 Oct 2021 17:56:50 -0400* by **jaku78**

## Four traversal methods of tree (recursive and non recursive implementation c++&java)

Traversal of tree:
1. Preorder traversal
2. Middle order traversal
3. Post order traversal
4. Sequence traversal
1. Preorder traversal
Preorder traversal, that is, DLR, first accesses the root node, then the left subtree, and then the right subtree. Therefore, traversal and backtracking are required
Recursio ...

Posted on *Wed, 22 Sep 2021 08:08:58 -0400* by **pelleas**