Get current working directory



Download 0,84 Mb.
bet7/21
Sana21.04.2022
Hajmi0,84 Mb.
#569000
1   2   3   4   5   6   7   8   9   10   ...   21
Bog'liq
notes2

Basic Operations


Following are the basic operations supported by a list.

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

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

  3. Display − Displays the complete list.

  4. Search − Searches an element using the given key.

  5. Delete − Deletes an element using the given key.

Types of Linked List


Following are the various types of linked list.

  1. Singly Linked List - This list consists of a number of nodes in which each node has a next pointer to the following element. The link of the last node in the list is NULL, which indicates the end of the list.

  2. Doubly Linked List - Items can be navigated forward and backward.

  3. 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.

Searching Algorithms



In this article, we will learn in details about the Binary Search algorithm. 

Let's first we will discuss some basics like what is searching for ? and why do we need searching ?.

What is Searching?


In computer science, searching is the process of finding an item with specified properties from a collection of items. The items may be stored as records in a database, simple data elements in arrays, text in files, nodes in trees, vertices and edges in graphs, or they may be elements of other search spaces.

Why do we need Searching?


Searching is one of the core computer science algorithms. We know that today’s computers store a lot of information. To retrieve ( ot find something and back to perivious position ) this information proficiently we need very efficient searching algorithms.
There are certain ways of organizing the data that improves the searching process. That means, if we keep the data in proper( suitable , correct ) order, it is easy to search the required element. Sorting is one of the techniques for making the elements ordered. In this article, we will see different searching algorithms.

Download 0,84 Mb.

Do'stlaringiz bilan baham:
1   2   3   4   5   6   7   8   9   10   ...   21




Ma'lumotlar bazasi mualliflik huquqi bilan himoyalangan ©hozir.org 2024
ma'muriyatiga murojaat qiling

kiriting | ro'yxatdan o'tish
    Bosh sahifa
юртда тантана
Боғда битган
Бугун юртда
Эшитганлар жилманглар
Эшитмадим деманглар
битган бодомлар
Yangiariq tumani
qitish marakazi
Raqamli texnologiyalar
ilishida muhokamadan
tasdiqqa tavsiya
tavsiya etilgan
iqtisodiyot kafedrasi
steiermarkischen landesregierung
asarlaringizni yuboring
o'zingizning asarlaringizni
Iltimos faqat
faqat o'zingizning
steierm rkischen
landesregierung fachabteilung
rkischen landesregierung
hamshira loyihasi
loyihasi mavsum
faolyatining oqibatlari
asosiy adabiyotlar
fakulteti ahborot
ahborot havfsizligi
havfsizligi kafedrasi
fanidan bo’yicha
fakulteti iqtisodiyot
boshqaruv fakulteti
chiqarishda boshqaruv
ishlab chiqarishda
iqtisodiyot fakultet
multiservis tarmoqlari
fanidan asosiy
Uzbek fanidan
mavzulari potok
asosidagi multiservis
'aliyyil a'ziym
billahil 'aliyyil
illaa billahil
quvvata illaa
falah' deganida
Kompyuter savodxonligi
bo’yicha mustaqil
'alal falah'
Hayya 'alal
'alas soloh
Hayya 'alas
mavsum boyicha


yuklab olish