Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit 12a2a12

Browse files
CSI-402 – 3(3-0)
1 parent d08ff4f commit 12a2a12

17 files changed

+13
-0
lines changed
Binary file not shown.
Lines changed: 13 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,13 @@
1+
1. Name three linear data structures and three divide and conquer strategies of data structures.
2+
2. Recursion function to find the sum of 1 to n numbers.
3+
3. Algorithm of Search Element in Binary Search Tree.
4+
4. Insertion sort algorithm and its time complexity.
5+
5. Find the best and worst time complexity of the following:
6+
for(i=0; i<n; ++i) {
7+
int j=0, k=0;
8+
for(; j >= 0 && arr[i] < arr[j]) {
9+
arr[j] = arr[i-1];
10+
j++;
11+
}
12+
}
13+
16.5 KB
Loading[フレーム]
11.1 KB
Loading[フレーム]
10.4 KB
Loading[フレーム]
8.72 KB
Loading[フレーム]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /