Commit5622355

committed

Determine two elements from the array whose sum is equal to specified sum

1 parent9122c79 commit5622355Copy full SHA for 5622355

File tree

+40

-0

lines changed

+40

-0

lines changed

Lines changed: 40 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,40 @@`
	`1`	`+# Author: OMKAR PATHAK`
	`2`	`+`
	`3`	`+# Given an array A[] of n numbers and another number x, determines whether or not there exist two elements`
	`4`	`+# in S whose sum is exactly x.`
	`5`	`+`
	`6`	`+defcheckSum(array,sum):`
	`7`	`+# sort the array in descending order`
	`8`	`+array=quickSort(array)`
	`9`	`+`
	`10`	`+leftIndex=0`
	`11`	`+rightIndex=len(array)-1`
	`12`	`+`
	`13`	`+whileleftIndex<rightIndex:`
	`14`	`+if (array[leftIndex]+array[rightIndex]==sum):`
	`15`	`+returnarray[leftIndex],array[rightIndex]`
	`16`	`+elif(array[leftIndex]+array[rightIndex]<sum):`
	`17`	`+leftIndex+=1`
	`18`	`+else:`
	`19`	`+rightIndex+=1`
	`20`	`+`
	`21`	`+returnFalse,False`
	`22`	`+`
	`23`	`+defquickSort(array):`
	`24`	`+iflen(array)<=1:`
	`25`	`+returnarray`
	`26`	`+pivot=array[len(array)//2]`
	`27`	`+left= [xforxinarrayifx<pivot]`
	`28`	`+middle= [xforxinarrayifx==pivot]`
	`29`	`+right= [xforxinarrayifx>pivot]`
	`30`	`+returnquickSort(left)+middle+quickSort(right)`
	`31`	`+`
	`32`	`+if__name__=='__main__':`
	`33`	`+myArray= [10,20,30,40,50]`
	`34`	`+sum=80`
	`35`	`+`
	`36`	`+number1,number2=checkSum(myArray,sum)`
	`37`	`+if(number1andnumber2):`
	`38`	`+print('Array has elements:',number1,'and',number2,'with sum:',sum)`
	`39`	`+else:`
	`40`	`+print('Array doesn\'t has elements with the sum:',sum)`

Comments

(0)