What Will It Take For DeFi Protocols To Seize The Future of Loan Payments?

To be sure, blockchain rose to the world stage on the back of Bitcoin’s remarkable performance. However, blockchain technology is gaining its significance, especially after the cryptocurrency ecosystem nearly collapsed in 2018. Today, the technology anchors around three primary use cases: staking, custody, and DeFi.

Decentralized Finance (DeFi) is particularly interesting because of the waves it is making. DeFi protocols such as Compound are taking the world by storm as more people realize how the ecosystem could revolutionize the global financial ecosystem. Just last month, Compound topped MakerDAO as the most valuable DeFi lending project.

Overall, the DeFi ecosystem’s trajectory is steepening upwards as more value is locked in DeFi projects. To put this in context, consider the value locked in DeFi projects in the last 30 days. In the period, the total value locked (TVL) in DeFi jumped 119% to settle at $2.279 billion. If this growth cannot convince one to onboard the DeFi ecosystem, then nothing will.

Source: DeFi Pulse

A New Era is Unreeling

Admittedly, there is a wave of DeFi protocols, but most are still in the abstract realm. Few protocols such as MakerDAO and Compound have been able to go live and to attract investors. These software pieces are coming up with solutions to problems that have plagued the legacy financial system for ages.

DeFi lending protocols enable users to access credit cheaply. On the other hand, lenders can earn high-interest rates on their investment. Importantly, the majority – if not all – of the DeFi developers agree that the protocols will right most of the ills of centralized finance (CeFi). There is a need for an alternative to traditional finance from the foregoing, one that serves all participants in good faith.DeFi lending protocols are more popular today because they enable everyone to supply cryptocurrencies and stablecoins and to earn interest on them. This another avenue for holders of the digital currencies to earn income other than trading them on exchanges

According to a report, DeFi is the fuel that will propel the financial innovations of the future. The innovations already began with the complete transformation of existing commercial products such as lending. This trustless ecosystem enables finance to reach the unbanked and the under-banked in a previously impossible way.

#defi #blockchain #decentralization #crypto #cryptocurrency #cryptocurrency-investment #cryptocurrency-payment

What is GEEK

Buddha Community

What Will It Take For DeFi Protocols To Seize The Future of Loan Payments?

Búsqueda lineal en Python

En esta publicación de Python, aprenderá lo siguiente:

  • ¿Qué es una búsqueda lineal?
  • Algoritmo de búsqueda lineal
  • Escriba un programa Python para búsqueda lineal usando While Loop
  • Escriba un programa Python para búsqueda lineal usando For Loop
  • Búsqueda lineal en el programa Python usando recursividad

¿Qué es una búsqueda lineal?

En primer lugar, una búsqueda lineal, también conocida como búsqueda secuencial, este método se utiliza para encontrar un elemento dentro de una lista o matriz. Comprueba cada elemento de la lista uno por uno / secuencialmente hasta que se encuentra una coincidencia o se ha buscado en toda la lista.

Algoritmo de búsqueda lineal

Implemente la búsqueda lineal siguiendo los pasos a continuación:

  • Recorre la lista / matriz usando un bucle.
  • En cada iteración, asocie el  target valor con el valor dado de la lista / matriz.
    • Si los valores coinciden, devuelve el índice actual de la lista / matriz.
    • De lo contrario, continúe con el siguiente elemento de matriz / lista.
  • Si no se encuentra ninguna coincidencia, regrese  -1.

Escriba un programa Python para búsqueda lineal usando While Loop

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Después de ejecutar el programa, la salida será:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Escriba un programa Python para búsqueda lineal usando For Loop

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Después de ejecutar el programa, la salida será:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Búsqueda lineal en el programa Python usando recursividad

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Después de ejecutar el programa, la salida será:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

 

藤本  結衣

藤本 結衣

1636296420

線形検索のためのPythonプログラム

このチュートリアルでは、Pythonで線形検索プログラムを作成する方法を学習します。

まず、線形検索(シーケンシャル検索とも呼ばれます)は、リストまたは配列内の要素を見つけるために使用されます。一致するものが見つかるか、リスト全体が検索されるまで、リストの各要素を1つずつ/順番にチェックします。

線形探索アルゴリズム

以下の手順に従って線形検索を実装します。

  • ループを使用してリスト/配列をトラバースします。
  • すべての反復で、target 値をリスト/配列の指定された値に関連付け ます。
    • 値が一致する場合は、リスト/配列の現在のインデックスを返します。
    • それ以外の場合は、次の配列/リスト要素に移動します。
  • 一致するものが見つからない場合は、を返し -1ます。

線形検索のためのPythonプログラム

  • whileループを使用した線形検索用のPythonプログラム
  • Forループを使用した線形検索用のPythonプログラム
  • 再帰を使用したPythonプログラムでの線形検索

whileループを使用した線形検索用のPythonプログラム

# python program for linear search using while loop
 
#define list
lst = []
 
#take input list size
num = int(input("Enter size of list :- "))
 
for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)
 
#take input number to be find in list   
x = int(input("Enter number to search in list :- "))
 
i = 0
flag = False
 
while i < len(lst):
    if lst[i] == x:
        flag = True
        break
  
    i = i + 1
  
if flag == 1:
    print('{} was found at index {}.'.format(x, i))
else:
    print('{} was not found.'.format(x))
    

プログラムの実行後、出力は次のようになります。

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Forループを使用した線形検索用のPythonプログラム

# python program for linear search using for loop
 
#define list
lst = []
 
#take input list size
num = int(input("Enter size of list :- "))
 
for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)
 
#take input number to be find in list   
x = int(input("Enter number to search in list :- "))
 
i = 0
flag = False
 
for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break
  
if flag == 1:
    print('{} was found at index {}.'.format(x, i))
else:
    print('{} was not found.'.format(x))
    

プログラムの実行後、出力は次のようになります。

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

再帰を使用したPythonプログラムでの線形検索

# python program for linear search using for loop
 
#define list
lst = []
 
#take input list size
num = int(input("Enter size of list :- "))
 
for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)
 
#take input number to be find in list   
x = int(input("Enter number to search in list :- "))
 
# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 
     
 
res = recLinearSearch(lst, 0, len(lst)-1, x) 
  
if res != -1:
    print('{} was found at index {}.'.format(x, res))
else:
    print('{} was not found.'.format(x))
    

プログラムの実行後、出力は次のようになります。

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

リンク: https://www.tutsmake.com/linear-search-in-python/

#python 

CODE VN

CODE VN

1637563159

Tìm kiếm tuyến tính bằng Python

Trong bài đăng python này, bạn sẽ tìm hiểu những điều sau:

  • Tìm kiếm tuyến tính là gì?
  • Thuật toán tìm kiếm tuyến tính
  • Viết chương trình Python để tìm kiếm tuyến tính bằng While Loop
  • Viết chương trình Python để tìm kiếm tuyến tính bằng For Loop
  • Tìm kiếm tuyến tính trong Chương trình Python sử dụng Đệ quy

Tìm kiếm tuyến tính là gì?

Trước hết, Tìm kiếm tuyến tính, còn được gọi là tìm kiếm tuần tự, phương pháp này được sử dụng để tìm một phần tử trong danh sách hoặc mảng. Nó kiểm tra từng phần tử của danh sách một / tuần tự cho đến khi tìm thấy một kết quả phù hợp hoặc toàn bộ danh sách đã được tìm kiếm.

Thuật toán tìm kiếm tuyến tính

Triển khai tìm kiếm tuyến tính theo các bước sau:

  • Duyệt qua danh sách / mảng bằng cách sử dụng một vòng lặp.
  • Trong mỗi lần lặp, hãy liên kết  target giá trị với giá trị đã cho của danh sách / mảng.
    • Nếu các giá trị khớp, trả về chỉ mục hiện tại của danh sách / mảng.
    • Nếu không, hãy chuyển sang phần tử mảng / danh sách tiếp theo.
  • Nếu không tìm thấy kết quả phù hợp, hãy quay lại  -1.

Viết chương trình Python để tìm kiếm tuyến tính bằng While Loop

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Viết chương trình Python để tìm kiếm tuyến tính bằng For Loop

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Tìm kiếm tuyến tính trong Chương trình Python sử dụng Đệ quy

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Sau khi thực hiện chương trình, kết quả đầu ra sẽ là:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

Lineare Suche in Python

In diesem Python-Beitrag erfahren Sie Folgendes:

  • Was ist eine lineare Suche?
  • Linearer Suchalgorithmus
  • Schreiben Sie ein Python-Programm für die lineare Suche mit While-Schleife
  • Schreiben Sie ein Python-Programm für die lineare Suche mit der For-Schleife
  • Lineare Suche im Python-Programm mit Rekursion

Was ist eine lineare Suche?

Eine lineare Suche, auch bekannt als sequentielle Suche, diese Methode wird verwendet, um ein Element innerhalb einer Liste oder eines Arrays zu finden. Es überprüft jedes Element der Liste nacheinander / sequentiell, bis eine Übereinstimmung gefunden wird oder die gesamte Liste durchsucht wurde.

Linearer Suchalgorithmus

Implementieren Sie die lineare Suche mit den folgenden Schritten:

  • Durchlaufen Sie die Liste/das Array mit einer Schleife.
  • Verknüpfen Sie in jeder Iteration den  target Wert mit dem angegebenen Wert der Liste/des Arrays.
    • Wenn die Werte übereinstimmen, geben Sie den aktuellen Index der Liste/des Arrays zurück.
    • Fahren Sie andernfalls mit dem nächsten Array-/Listenelement fort.
  • Wenn keine Übereinstimmung gefunden wird, geben Sie zurück  -1.

Schreiben Sie ein Python-Programm für die lineare Suche mit While-Schleife

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Schreiben Sie ein Python-Programm für die lineare Suche mit der For-Schleife

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Lineare Suche im Python-Programm mit Rekursion

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Nach der Ausführung des Programms lautet die Ausgabe:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.

Pesquisa Linear em Python

Nesta postagem python, você aprenderá o seguinte:

  • O que é uma pesquisa linear?
  • Algoritmo de pesquisa linear
  • Escreva um programa Python para pesquisa linear usando loop while
  • Escreva um programa Python para pesquisa linear usando o loop for
  • Pesquisa linear no programa Python usando recursão

O que é uma pesquisa linear?

Em primeiro lugar, uma pesquisa linear, também conhecida como pesquisa sequencial, este método é usado para localizar um elemento dentro de uma lista ou array. Ele verifica cada elemento da lista um por um / sequencialmente até que uma correspondência seja encontrada ou toda a lista tenha sido pesquisada.

Algoritmo de pesquisa linear

Implemente a pesquisa linear seguindo as etapas abaixo:

  • Percorra a lista / array usando um loop.
  • Em cada iteração, associe o target valor ao  valor fornecido da lista / matriz.
    • Se os valores corresponderem, retorne o índice atual da lista / matriz.
    • Caso contrário, vá para o próximo elemento de array / lista.
  • Se nenhuma correspondência for encontrada, retorne  -1.

Escreva um programa Python para pesquisa linear usando loop while

# python program for linear search using while loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

while i < len(lst):
	if lst[i] == x:
		flag = True
		break

	i = i + 1

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  5
Enter the array of 0 element :-  10
Enter the array of 1 element :-  23
Enter the array of 2 element :-  56
Enter the array of 3 element :-  89
Enter the array of 4 element :-  200
Enter number to search in list :-  89
89 was found at index 3.

Escreva um programa Python para pesquisa linear usando o loop for

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

i = 0
flag = False

for i in range(len(lst)):
    if lst[i] == x:
        flag = True
        break

if flag == 1:
	print('{} was found at index {}.'.format(x, i))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  6
Enter the array of 0 element :-  25
Enter the array of 1 element :-  50
Enter the array of 2 element :-  100
Enter the array of 3 element :-  200
Enter the array of 4 element :-  250
Enter the array of 5 element :-  650
Enter number to search in list :-  200
200 was found at index 3.

Pesquisa linear no programa Python usando recursão

# python program for linear search using for loop

#define list
lst = []

#take input list size
num = int(input("Enter size of list :- "))

for n in range(num):
    #append element in list/array
    numbers = int(input("Enter the array of %d element :- " %n))
    lst.append(numbers)

#take input number to be find in list   
x = int(input("Enter number to search in list :- "))

# Recursive function to linear search x in arr[l..r]  
def recLinearSearch( arr, l, r, x): 
    if r < l: 
        return -1
    if arr[l] == x: 
        return l 
    if arr[r] == x: 
        return r 
    return recLinearSearch(arr, l+1, r-1, x) 

res = recLinearSearch(lst, 0, len(lst)-1, x) 

if res != -1:
	print('{} was found at index {}.'.format(x, res))
else:
	print('{} was not found.'.format(x))

Depois de executar o programa, a saída será:

Enter size of list :-  5
Enter the array of 0 element :-  14
Enter the array of 1 element :-  25
Enter the array of 2 element :-  63
Enter the array of 3 element :-  42
Enter the array of 4 element :-  78
Enter number to search in list :-  78
78 was found at index 4.