没有合适的资源？快使用搜索试试~ 我知道了~

首页97页精华：英文版数据结构与算法速成指南

97页精华：英文版数据结构与算法速成指南

数据结构

快速入门

需积分: 12 17 下载量 134 浏览量更新于2024-07-18 收藏 7.88MB PDF 举报

身份认证购VIP最低享 7 折!

30元优惠券

试读

97页

"《数据结构与算法快速入门》是一本英文原版的简短教程，仅包含97页的内容，旨在帮助读者在学习计算机科学的同时掌握数据结构与算法的基础知识。这本书以实践为导向，结合英语学习，让读者在轻松愉快的氛围中提升技能。该资源的核心内容包括数据结构的基本概念和术语。首先，它定义了数据结构的接口，这是数据结构的核心组成部分，它定义了数据结构支持的操作类型，例如，可以接受的参数类型以及这些操作的返回值类型。理解并遵循接口是设计和使用数据结构的关键。其次，实施部分深入解析数据结构的内部实现，包括算法的设计和实现。它展示了如何通过特定的数据结构设计来优化时间和空间效率，这两个概念在计算复杂性和空间复杂性分析中至关重要。正确性（Correctness）是评估数据结构实现的标准之一，确保其满足接口定义的功能。时间复杂度（Time Complexity）关注的是执行数据结构操作所需的时间，通常以算法运行时间的最坏、最好和平均情况来衡量。空间复杂度（Space Complexity）则是衡量数据结构内存使用的效率，尽量减少不必要的存储空间。此外，学习者可以通过链接 'https://www.tutorialspoint.com/data_structures_algorithms/dsa_quick_guide.htm' 访问该指南，获取具体的实例和练习，以便于将理论知识转化为实际操作能力。这个资源适合初学者作为入门指南，也适合有一定基础的读者快速回顾和巩固基础知识。这本快速入门教程为想要进入数据结构与算法领域的学习者提供了一个高效的学习路径，它强调了理论与实践的结合，是提高编程技能、理解计算机运作机制的重要参考资料。"

资源详情

资源推荐

Deletion refers to removing an existing element from the array and re-organizing all elements of an array.

Algorithm

Consider LA is a linear array with N elements and K is a positive integer such that K<=N. Following is the

algorithm to delete an element available at the K

position of LA.

1. Start

2. Set J = K

3. Repeat steps 4 and 5 while J < N

4. Set LA[J] = LA[J + 1]

5. Set J = J+1

6. Set N = N-1

7. Stop

Example

Following is the implementation of the above algorithm −

Live Demo

#include

<stdio.h>

void

main() {

int

LA[] = {1,3,5,7,8};

int

k = 3, n = 5;

int

i, j;

printf("The original array elements are :\n");

for

(i = 0; i<n; i++) {

printf("LA[%d] = %d \n", i, LA[i]);

}

j = k;

while

( j < n) {

LA[j-1] = LA[j];

j = j + 1;

}

n = n -1;

printf("The array elements after deletion :\n");

for

(i = 0; i<n; i++) {

printf("LA[%d] = %d \n", i, LA[i]);

}

When we compile and execute the above program, it produces the following result −

Output

The original array elements are :

LA[0] = 1

LA[1] = 3

LA[2] = 5

LA[3] = 7

LA[4] = 8

The array elements after deletion :

LA[0] = 1

LA[1] = 3

LA[2] = 7

LA[3] = 8

Search Operation

You can perform a search for an array element based on its value or its index.

Algorithm

Consider LA is a linear array with N elements and K is a positive integer such that K<=N. Following is the

algorithm to find an element with a value of ITEM using sequential search.

1. Start

2. Set J = 0

3. Repeat steps 4 and 5 while J < N

4. IF LA[J] is equal ITEM THEN GOTO STEP 6

5. Set J = J +1

6. PRINT J, ITEM

7. Stop

Example

Following is the implementation of the above algorithm −

Live Demo

#include

<stdio.h>

void

main() {

int

LA[] = {1,3,5,7,8};

int

item = 5, n = 5;

int

i = 0, j = 0;

printf("The original array elements are :\n");

for

(i = 0; i<n; i++) {

printf("LA[%d] = %d \n", i, LA[i]);

}

while

( j < n){

( LA[j] == item ) {

break

;

}

j = j + 1;

}

printf("Found element %d at position %d\n", item, j+1);

}

When we compile and execute the above program, it produces the following result −

Output

The original array elements are :

LA[0] = 1

LA[1] = 3

LA[2] = 5

LA[3] = 7

LA[4] = 8

Found element 5 at position 3

Update Operation

Update operation refers to updating an existing element from the array at a given index.

Algorithm

Consider LA is a linear array with N elements and K is a positive integer such that K<=N. Following is the

algorithm to update an element available at the K

position of LA.

1. Start

2. Set LA[K-1] = ITEM

3. Stop

Example

Following is the implementation of the above algorithm −

Live Demo

#include

<stdio.h>

void

main() {

int

LA[] = {1,3,5,7,8};

int

k = 3, n = 5, item = 10;

int

i, j;

printf("The original array elements are :\n");

for

(i = 0; i<n; i++) {

printf("LA[%d] = %d \n", i, LA[i]);

}

LA[k-1] = item;

printf("The array elements after updation :\n");

for

(i = 0; i<n; i++) {

printf("LA[%d] = %d \n", i, LA[i]);

}

When we compile and execute the above program, it produces the following result −

Output

The original array elements are :

LA[0] = 1

LA[1] = 3

LA[2] = 5

LA[3] = 7

LA[4] = 8

The array elements after updation :

LA[0] = 1

LA[1] = 3

LA[2] = 10

LA[3] = 7

LA[4] = 8

DATA STRUCTURE AND ALGORITHMS - LINKED LIST

A linked list is a sequence of data structures, which are connected together via links.

Linked List is a sequence of links which contains items. Each link contains a connection to another link.

Linked list is the second most-used data structure after array. Following are the important terms to

understand the concept of Linked List.

Link − Each link of a linked list can store a data called an element.

Next − Each link of a linked list contains a link to the next link called Next.

LinkedList − A Linked List contains the connection link to the first link called First.

Linked List Representation

Linked list can be visualized as a chain of nodes, where every node points to the next node.

As per the above illustration, following are the important points to be considered.

Linked List contains a link element called first.

Each link carries a data field and a link field called next.

Each link is linked with its next link using its next link.

Last link carries a link as null to mark the end of the list.

Types of Linked List

Following are the various types of linked list.

Simple Linked List − Item navigation is forward only.

Doubly Linked List − Items can be navigated forward and backward.

Circular Linked List − Last item contains link of the first element as next and the first element has a

link to the last element as previous.

Basic Operations

Following are the basic operations supported by a list.

Insertion − Adds an element at the beginning of the list.

Deletion − Deletes an element at the beginning of the list.

Display − Displays the complete list.

Search − Searches an element using the given key.

Delete − Deletes an element using the given key.

Insertion Operation

Adding a new node in linked list is a more than one step activity. We shall learn this with diagrams here. First,

create a node using the same structure and find the location where it has to be inserted.

Imagine that we are inserting a node B , between A and C . Then point

B.next to C −

NewNode.next −> RightNode;

It should look like this −

Now, the next node at the left should point to the new node.

LeftNode.next −> NewNode;

NewNode

LeftNode RightNode

剩余96页未读，继续阅读

粉丝: 4
资源: 12

上传资源快速赚钱

我的内容管理展开

我的资源快来上传第一个资源

我的收益

登录查看自己的收益

我的积分登录查看自己的积分

我的C币登录后查看C币余额

我的收藏

我的下载

下载帮助

97页精华：英文版数据结构与算法速成指南

10本经典的数据结构和算法书1（英文）

数据结构2013修订版 英文原版

算法第四版 英文原版

Java版数据结构与算法入门指南

LISP快速入门（英文原版）

SpringBoot入门指南：数据结构与算法分析应用

SpringBoot入门与CORS支持——数据结构与算法分析实践

SpringBoot入门与Git信息：数据结构与算法分析实践

SpringBoot入门与SSL配置-数据结构与算法分析应用

SpringBoot入门与内嵌Shell：数据结构与算法分析实践

SpringBoot入门与SSL配置管理：数据结构与算法分析

SpringBoot入门指南：数据结构与算法解析C++实现

SpringBoot入门：数据结构与算法分析第四版导引

SpringBoot入门与系统指标：数据结构与算法在C++中的分析

SpringBoot入门与数据结构算法分析

SpringBoot入门与数据结构算法详解

c++数据结构第三版（国外教材，英文版）

最新资源

数据结构2013修订版英文原版

算法第四版英文原版