Add problems

majorelement.py

@@ -0,0 +1,27 @@
+# Moore's voting Algorithm for major element in an Array
+
+arr=[1,2,3,4,5]
+major=arr[0]
+count=1
+n=len(arr)
+for i in range(1,n):
+    if major==arr[i]:
+        count+=1
+    else:
+        count-=1
+    if count ==0:
+        major=arr[i]
+
+c=0
+for i in range(n):
+    if major==arr[i]:
+        c+=1
+
+if c>n//2:
+    print(major)
+else:
+    print("No answer")
+
+
+# This algorithm works on the concept element priority in the array.
+# if next index number is same as preceeding number then importance of the element increases otherwise decreases.

stacksortrecur.py

@@ -0,0 +1,3 @@
+st=[10,20,220,30,40]
+st.pop()
+print(st)

trailingzeroes.py

@@ -1,6 +1,8 @@
 n=int(input())
 res=0
-for i in range(5,n,*5):
+i=5
+while i<=n:
     res+=n/i
+    i=i*5
 
 print(res)