• Searching
  • Linear search
  • Binary Search
  • sorted and rotated array

• Sorting
  • Bubble sort
  • Selection sort
  • insertion sort
  • Merge Sort

• LinkList
  • singly linked
  • Doubly Linked
  • Circular linked

Reverse list in python without using function || reverse Function

---

Merge is another sorting Technique, the merge sort is divide and conquer algorithm,The merge sort is break the list into the sublist,this algorithm complexity is Ο(n log n), that means this respected algorithm,Merge sort is divide the array into equal halves and combining the sorted manner,

code:

arr=[1,2,3,4,5,6];

L=len(arr);
for i in range(0,L//2):
    n=arr[i];
    arr[i]=arr[L-i-1];
    arr[L-i-1]=n;
print(arr)